bluuebunny/crossref_metadata_2025_split huggingface dataset:
Predicting children's internalizing symptoms across development from early emotional reactivity
Authors: Gabel Lindsay N. , Mohamed Ali Ola , Kotelnikova Yuliya , Tremblay Paul F. , Stanton Kasey J. , Durbin C. Emily , Hayden Elizabeth P. 
Published: March 2023

AbstractCurrent methods of assessing children's emotional reactivity fail to capture individual differences in emotion across contexts that may be meaningfully related to youth psychopathology. We therefore explored the utility of modeling variability in young children's positive and negative emotion across emotionally evocative laboratory tasks to predict later adjustment. At age 3, 409 children completed a battery of laboratory tasks eliciting either positive or negative affect. We used latent difference score (LDS) modeling to predict children's caregiver‐reported internalizing symptoms across ages 3, 5, 8, and 11 from variability in their observer‐rated positive and negative emotion across laboratory tasks. We found that sex moderated the association between both average and variability measures of children's negative emotion at age 3 and trajectories of their anxious‐depressive symptoms across childhood. Measures of emotion variability predicted children's internalizing symptoms above and beyond measures of average emotion. Variability indices also provided unique information about the trajectories of children's symptoms. We discuss implications for the utility of LDS modeling in assessing children's emotional reactivity.
Modulation of Heat Transfer in a Porous Burner Based on Triply Periodic Minimal Surface
Authors: Cheng Zhilong , Li Song , Chen Wei , Wang Qiuwang 
Published: March 2023

Abstract
The list of reacting flows in porous media applications is quite long, including porous media combustion, syngas production, and fuel cells. Porous media combustion is recognized as a cutting-edge combustion technique for increasing flammability. In this process, heat is transferred from the exothermic reaction zone to the incoming reactants through porous media. This role of porous media distinguishes reacting flows in porous media from free combustion processes. Local heat transfer, such as solid conduction, solid–solid radiation, and solid–gas convection, as well as the response behavior, are affected by the topology of the porous material. Theoretical studies indicate that continuously graded porous materials can significantly enhance the performance benefits of heat transfer. However, topology design is challenging for smooth graded porous media, and thus investigations of combustion within graded porous media are still required. In this study, we constructed a porous structure of type W/P/D/G (porosity ε = 0.3–0.5, hydraulic diameter dh = 1.33–3.86 mm) using a triply periodic minimal surface (TPMS), and a computational model of the combustion reaction in porous media was established to compare the range of flame stability within different pore types. In addition, topology gradation was achieved via TPMS to modulate the heat transfer to ensure the dependable functioning of premixed flames and improved heat recirculation. Heat transfer in the graded TPMS-based porous structure was analyzed numerically. The conclusions obtained from this study can effectively address the aforementioned challenges related to porous media burner design.
Numerical Study of a Non-Linear Porous Sublimation Problem With Temperature-Dependent Thermal Conductivity and Concentration-Dependent Mass Diffusivity
Authors: Chaurasiya Vikas , Jain Ankur , Singh Jitendra 
Published: March 2023

AbstractSublimation heat transfer occurs in a wide range of engineering processes, such as accelerated freeze drying (AFD), energy storage, and food technology. Particularly in the microwave AFD process, preservation of material with the least possible energy consumption is desirable. In connection with this, it is of interest to analyze the effect of temperature/concentration dependent heat/mass transfer properties. Given the limited literature available on sublimation, there is a general lack of physical understanding of this particular problem. The present work analyzes the nonlinear sublimation process driven by convective heat/mass transfer and evaporation of water vapor using the Legendre wavelet collocation method (LWCM). Results from the present work are shown to be in excellent agreement with the exact solution of the special case of a linear problem. Further, the present numerical technique shows good agreement with finite difference method in case of a completely nonlinear model. The model is used for a comprehensive investigation of the impact of the problem parameters, on the rate of sublimation. It is found that the sublimation rate increases with increasing values of β1 and decreasing values of β2. The impact of other dimensionless problem parameters such as Péclet numbers Pe1 and Pem, convection due to mass transfer of water vapor β, latent heat of sublimation l0 and Luikov number Lu on sublimation process is also discussed in detail. These observations offer a comprehensive theoretical and mathematical understanding of sublimation heat/mass transfer for improving the performance and efficiency of freeze-drying and related engineering processes.
Stress Analysis of ASME Section X Flanges Using Classical Lamination Theory
Authors: Bouzid Sofiane , Bouzid Abdel-Hakim , Ngô Anh Dung 
Published: March 2023

AbstractThe increased usage of fiber reinforced plastic (FRP) composite pressure vessels and piping components in the past decades in the residential and industrial sectors is attributed to the FRP material resistance to corrosion and chemical attacks. FRP composite flanges are, however, known for their anisotropic behavior. In the ASME code section X, FRP composite flanges are treated using an analytical approach derived from that metallic flanges in addition to the fact that the geometries are made to fit them as much as possible and not designed independently. This is known to have caused structural flaws for certain FRP flange classes and sizes. Using a recently developed anisotropic FRP flange approach, it is proposed to identify the most critical flanges by analyzing the flange parameters such as flange ring rotation and stresses in their different parts; gasket, flange ring, hub, and shell subjected to pressure loading. The study on the strength of flanges described in ASME section X RD-620.1 table, will reveal the most critical size and class flanges and their highly stressed locations. To conduct such a study, the selected flange material is an E glass/Vinyl Ester laminate composite. The study shows that FRP flanges of classes 25 and 50 are most vulnerable and should comparatively be less loaded. The stresses are found to reach 50 MPa in the shell and 58 MPa in the flange ring while the maximum flange rotation is 0.83 deg.
Shortcut in codimension-2 brane cosmology in light of GW170817
Authors: Lin Zi-Chao , Yu Hao , Liu Yu-Xiao 
Published: March 2023

AbstractIn this paper, our universe is regarded as a codimension-2 brane embedded in a noncompact six-dimensional Anti-de Sitter (AdS) spacetime. We derive the gravitational horizon radius on the brane under the low-energy approximation, which reflects how the extra dimensions cause the shortcut effect of gravitational waves (GWs). We also study the time delay between a GW signal and an electromagnetic (EM) wave signal in the low-redshift limit by combining with the joint observations of GW170817 and GRB 170817A, which gives an upper limit to the $$\text {AdS}_{6}$$

AdS
6

radius as $$\ell ^{2}_{~} \lesssim 3.84\,\text {Mpc}^{2}_{~}$$

ℓ

2

≲
3.84

Mpc

2

. For a high-redshift source, the time delay is converted into the discrepancy between the source redshift derived from the GW signal and the one derived from the EM counterpart. It is found that if one expects to detect the EM counterpart of a high-redshift GW event within a reasonable observation time, it requires a stronger constraint on the $$\text {AdS}_{6}$$

AdS
6

radius. Our research shows that the $$\text {AdS}_{6}$$

AdS
6

radius should satisfy $$\ell ^{2}_{~}\lesssim 0.02\,\text {Mpc}^{2}_{~}$$

ℓ

2

≲
0.02

Mpc

2

for the DECIGO and BBO.
Exploring the mechanisms leading to diffuse and filamentary modes in dielectric barrier discharges in N$$_2$$ with N$$_2$$O admixtures
Authors: Höft Hans , Becker Markus M. , Kettlitz Manfred , Dap Simon , Naudé Nicolas , Brandenburg Ronny , Weltmann Klaus-Dieter 
Published: March 2023

Abstract
The effects of nitrous oxide (N$$_2$$

2

O) in nitrogen (N$$_2$$

2

) on the development and morphology of sine-driven dielectric barrier discharges in a single-filament arrangement were studied. Detailed insight in the characteristics of the discharge and its development were obtained from electrical measurements combined with ICCD and streak camera recordings as well as numerical modelling. A miniaturised atmospheric pressure Townsend discharge (APTD) could be generated for admixtures up to 5 vol% N$$_2$$

2

O in N$$_2$$

2

although N$$_2$$

2

O is an efficient collisional quencher of metastable nitrogen molecules. Increasing the high voltage amplitude led to a transition into a hybrid mode with the generation of an intermediate filament in addition to the diffuse, non-constricted APTD. A time-dependent, spatially one-dimensional fluid model was applied in order to study the underlying mechanisms causing the diffuse discharge characteristics. It was found that even for small N$$_2$$

2

O admixtures, the associative ionisation of atomic nitrogen and oxygen (O + N($$^2$$

2

P) $$\rightarrow $$
→
NO$$^+$$

+

+ e) is the major electron source sustaining the volume memory effect and is therefore the reason for the formation of a diffuse APTD.

Graphical abstract
A computational analysis of accessibility, readability, and explainability of figures in open access publications
Authors: Zhuang Han , Huang Tzu-Yang , Acuna Daniel E. 
Published: March 2023

AbstractFigures are an essential part of scientific communication. Yet little is understood about how accessible (e.g., color-blind safe), readable (e.g., good contrast), and explainable (e.g., contain captions and legends) they are. We develop computational techniques to measure these features and analyze a large sample of them from open access publications. Our method combines computer and human vision research principles, achieving high accuracy in detecting problems. In our sample, we estimated that around 20.6% of publications contain either accessibility, readability, or explainability issues (around 2% of all figures contain accessibility issues, 3% of diagnostic figures contain readability issues, and 23% of line charts contain explainability issues). We release our analysis as a dataset and methods for further examination by the scientific community.
Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks
Authors: Addanki Vamsi , Avin Chen , Schmid Stefan 
Published: March 2023

The performance of large-scale computing systems often critically depends on high-performance communication networks. Dynamically reconfigurable topologies, e.g., based on optical circuit switches, are emerging as an innovative new technology to deal with the explosive growth of datacenter traffic. Specifically, periodic reconfigurable datacenter networks (RDCNs) such as RotorNet (SIGCOMM 2017), Opera (NSDI 2020) and Sirius (SIGCOMM 2020) have been shown to provide high throughput, by emulating a complete graph through fast periodic circuit switch scheduling.
However, to achieve such a high throughput, existing reconfigurable network designs pay a high price: in terms of potentially high delays, but also, as we show as a first contribution in this paper, in terms of the high buffer requirements. In particular, we show that under buffer constraints, emulating the high-throughput complete graph is infeasible at scale, and we uncover a spectrum of unvisited and attractive alternative RDCNs, which emulate regular graphs, but with lower node degree than the complete graph.
We present Mars, a periodic reconfigurable topology which emulates ad-regular graph with near-optimal throughput. In particular, we systematically analyze how the degree d can be optimized for throughput given the available buffer and delay tolerance of the datacenter. We further show empirically that Mars achieves higher throughput compared to existing systems when buffer sizes are bounded.
Fiat Lux: Illuminating IPv6 Apportionment with Different Datasets
Authors: Hsu Amanda , Li Frank , Pearce Paul 
Published: March 2023

IPv6 adoption continues to grow, making up more than 40% of client traffic to Google globally. While the ubiquity of the IPv4 address space makes it comparably easier to understand, the vast and less studied IPv6 address space motivates a variety of works detailing methodology to collect and analyze IPv6 properties, many of which use knowledge from specific data sources as a lens for answering research questions. Despite such work, questions remain on basic properties such as the appropriate prefix size for different research tasks.
Our work fills this knowledge gap by presenting an analysis of the apportionment of the IPv6 address space from the ground-up, using data and knowledge from numerous data sources simultaneously, aimed at identifying how to leverage IPv6 address information for a variety of research tasks. Utilizing WHOIS data from RIRs, routing data, and hitlists, we highlight fundamental differences in apportionment sizes and structural properties depending on data source and examination method. We focus on the different perspectives each dataset offers and the disjoint, heterogeneous nature of these datasets when taken together. We additionally leverage a graph-based analysis method for these datasets that allows us to draw conclusions regarding when and how to intersect the datasets and their utility. The differences in each dataset's perspective is not due to dataset problems but rather stems from a variety of differing structural and deployment behaviors across RIRs and IPv6 providers alike. In light of these inconsistencies, we discuss network address partitioning, best practices, and considerations for future IPv6 measurement and analysis projects.
Go-to-Controller is Better: Efficient and Optimal LPM Caching with Splicing
Authors: Gozlan Itamar , Avin Chen , Einziger Gil , Scalosub Gabriel 
Published: March 2023

Modern data center networks are required to support huge and complex forwarding policies as they handle the traffic of the various tenants. However, these policies cannot be stored in their entirety within the limited memory available at commodity switches. The common approach in such scenarios is to have SDN controllers manage the memory available at the switch as a fast cache, updating and changing the forwarding rules in the cache according to the workloads dynamics and the global policy at hand. Many such policies, such as Longest-prefix-match (LPM) policies, introduce dependencies between the forwarding rules. Ensuring that the cache content is always consistent with the global policy often requires the switch to store (potentially many) superfluous rules, which may lead to suboptimal performance in terms of delay and throughput.To overcome these deficiencies, previous work suggested the concept of splicing, where modified Go-to-Controller rules can be inserted into the cache to improve performance while maintaining consistency. These works focused mostly on heuristics, and it was conjectured that the problem is computationally intractable. As our main result, we show that the problem of determining the optimal set of rules, with splicing, can actually be solved efficiently by presenting a polynomial-time algorithm that produces an optimal solution, i.e., for a given cache size we find an optimal set of rules, some of which are go-to-controller, which maximize the total weight of the cache while maintaining consistency. However, such optimality comes at a cost, encompassed by the fact that our algorithm has a significantly larger running time than SoTA solutions which do not employ splicing. Therefore, we further present a heuristic exhibiting close-to-optimal performance, with significantly improved running time, matching that of the best algorithm, which does not employ splicing. In addition, we present the results of an evaluation study that compares the performance of our solutions with that of SoTA approaches, showing that splicing can reduce the cache miss ratio by as much as 30%, without increasing the cache size. Lastly, we propose a simple and fast-to-compute metric (that is consistency-oblivious) in order to evaluate the potential benefits of splicing compared to classical LPM-caching, for a given policy and traffic distribution. We show that our metric is highly correlated with such benefits, thus serving as an indication of whether splicing should be incorporated within the system architecture.
Duo: A High-Throughput Reconfigurable Datacenter Network Using Local Routing and Control
Authors: Zerwas Johannes , Györgyi Csaba , Blenk Andreas , Schmid Stefan , Avin Chen 
Published: March 2023

The performance of many cloud-based applications critically depends on the capacity of the underlying datacenter network. A particularly innovative approach to improve the throughput in datacenters is enabled by emerging optical technologies, which allow to dynamically adjust the physical network topology, both in an oblivious or demand-aware manner. However, such topology engineering, i.e., the operation and control of dynamic datacenter networks, is considered complex and currently comes with restrictions and overheads.
We present Duo, a novel demand-aware reconfigurable rack-to-rack datacenter network design realized with a simple and efficient control plane. Duo is based on the well-known de Bruijn topology (implemented using a small number of optical circuit switches) and the key observation that this topology can be enhanced using dynamic (''opportunistic'') links between its nodes.
In contrast to previous systems, Duo has several desired features: i) It makes effective use of the network capacity by supporting integrated and multi-hop routing (paths that combine both static and dynamic links). ii) It uses a work-conserving queue scheduling which enables out-of-the-box TCP support. iii) Duo employs greedy routing that is implemented using standard IP longest prefix match with small forwarding tables. And iv) during topological reconfigurations, routing tables require only local updates, making this approach ideal for dynamic networks.
We evaluate Duo in end-to-end packet-level simulations, comparing it to the state-of-the-art static and dynamic networks designs. We show that Duo provides higher throughput, shorter paths, lower flow completion times for high priority flows, and minimal packet reordering, all using existing network and transport layer protocols. We also report on a proof-of-concept implementation of Duo's control and data plane.
Asynchronous Automata Processing on GPUs
Authors: Liu Hongyuan , Pai Sreepathi , Jog Adwait 
Published: March 2023

Finite-state automata serve as compute kernels for many application domains such as pattern matching and data analytics. Existing approaches on GPUs exploit three levels of parallelism in automata processing tasks: 1)~input stream level, 2)~automaton-level and 3)~state-level. Among these, only state-level parallelism is intrinsic to automata while the other two levels of parallelism depend on the number of automata and input streams to be processed. As GPU resources increase, a parallelism-limited automata processing task can underutilize GPU compute resources.
To this end, we propose AsyncAP, a low-overhead approach that optimizes for both scalability and throughput. Our insight is that most automata processing tasks have an additional source of parallelism originating from the input symbols which has not been leveraged before. Making the matching process associated with the automata tasks asynchronous, i.e., parallel GPU threads start processing an input stream from different input locations instead of processing it serially, improves throughput significantly and scales with input length.
When the task does not have enough parallelism to utilize all the GPU cores, detailed evaluation across 12 evaluated applications shows that AsyncAP achieves up to 58× speedup on average over the state-of-the-art GPU automata processing engine. When the tasks have enough parallelism to utilize GPU cores, AsyncAP still achieves 2.4× speedup.
Abstract CC1-2-1: Duration of endocrine therapy
Authors: Mamounas Eleftherios (Terry) , Ruddy Kathryn 
Published: March 2023

Abstract
Patients with hormone-receptor positive, early-stage breast cancer are at considerable risk for late recurrence.
Previous randomized clinical trials have shown that extending adjuvant tamoxifen to ten vs. five years improves disease-free survival (and overall survival in one trial). Adding five years of an aromatase inhibitor (AI) after five years of tamoxifen has also been shown to significantly improve disease-free survival in postmenopausal patients. Benefit from extending adjuvant AI therapy beyond five years in patients who have received five years of an AI or tamoxifenàAI has also been recently demonstrated in several clinical trials but the absolute benefit appears small and the ideal duration of the extended therapy is still a topic of debate.
Over the past decade, efforts have focused on identifying predictors of risk of late recurrence and predictors of benefit from extended endocrine therapy. Clinicopathologic factors and circulating tumor cells can predict risk of late recurrence but not benefit from extended ET. Several commercially available genomic classifiers can further stratify risk of late recurrence, and some have also been found to predict benefit from extended ET. Their clinical utility for tailoring the use of extended endocrine therapy continues to evolve.
Citation Format: Eleftherios (Terry) Mamounas, Kathryn Ruddy. Duration of endocrine therapy [abstract]. In: Proceedings of the 2022 San Antonio Breast Cancer Symposium; 2022 Dec 6-10; San Antonio, TX. Philadelphia (PA): AACR; Cancer Res 2023;83(5 Suppl):Abstract nr CC1-2-1.
Abstract ED1-3: Where are we going with digital interventions and PROs
Authors: Luis Ines Vaz 
Published: March 2023

Abstract
Rational: Lately, digital health has shown potential to facilitate cancer care delivery. We now have data that demonstrated that systems integrating self-reporting of common symptoms during treatment for both adjuvant and metastatic breast cancer treatment and allowing for patient remote monitoring result not only result in better quality of life and less emergency room visits, but, in some settings, also lead to significant survival benefit. In addition, some studies incorporating self-management strategies that do not need heavy clinician involvement have shown promising results to manage acute and long and late term physical, social, and psychological effects of cancer and its treatment.
Objectives: In this talk, we will 1) review data on the existing digital health solutions that can be used in clinical care. In addition, 2) we will reflect on what is next in digital health innovation, particularly a) how the integration of technology, including digital companions facilitating remote monitoring, education and self-management, may serve as a vehicle to promote continuous care b) innovative emerging digital health tools (including, although not limited to wearables and digital therapeutics).Finally, 3) we will examine how digital health can address the needs of every patient, avoid pitfalls such as contributing to health disparities.
Citation Format: Ines Vaz Luis. Where are we going with digital interventions and PROs [abstract]. In: Proceedings of the 2022 San Antonio Breast Cancer Symposium; 2022 Dec 6-10; San Antonio, TX. Philadelphia (PA): AACR; Cancer Res 2023;83(5 Suppl):Abstract nr ED1-3.