Miracle-dz/UniFAR-FTUs huggingface dataset:
Association Proceedings of the Third USENIX Conference on File and Storage Technologies San Francisco , CA , USA March 31 – April 2 , 2004

This paper describes a programming framework for clean construction of disk maintenance applications. They can use it to expose the disk activity to be done, and then process completed requests as they are reported. The system ensures that these applications make steady forward progress without competing for disk access with a system’s primary applications. It opportunistically completes maintenance requests by using disk idle time and freeblock scheduling. In this paper, three disk maintenance applications (backup, write-back cache destaging, and disk layout reorganization) are adapted to the system support and evaluated on a FreeBSD implementation. All are shown to successfully execute in busy systems with minimal (e.g., 2%) impact on foreground disk performance. In fact, by modifying FreeBSD’s cache to write dirty blocks for free, the average read cache miss response time is decreased by 15–30%. For non-volatile caches, the reduction is almost 50%.
Investigating the parametric dependence of the impact of two-way coupling on inertial particle settling in turbulence

Tom et al.\ (J.\ Fluid Mech.\ 947, A7, 2022) investigated the impact of two-way coupling (2WC) on particle settling in turbulence. For the limited parameter choices explored, it was found that 2WC substantially enhances particle settling compared to the one-way coupled (1WC) case, even at low mass loading $\Phi_m$. Moreover, contrary to previous claims, it was demonstrated that preferential sweeping remains the mechanism responsible for the particles settling faster than the Stokes settling velocity in 2WC flows. However, crucial questions remain: 1) how small must $\Phi_m$ be for the effects of 2WC on particle settling to be negligible? 2) does the preferential sweeping mechanism remain relevant in 2WC flows as $\Phi_m$ is increased? To answer these, we explore a much broader portion of the parameter space, and our simulations cover cases where the impact of 2WC on the global fluid statistics ranges from negligible to strong. We find that even for $\Phi_m=7.5\times 10^{-3}$, 2WC can noticeably increase the settling for some choices of the Stokes and Froude numbers. We also demonstrate that even when $\Phi_m$ is large enough for the global fluid statistics to be strongly affected by the particles, preferential sweeping is still the mechanism responsible for the enhanced particle settling. The difference between the 1WC and 2WC cases is that, in the latter the particles are not merely swept around the downward-moving side of vortices, but they also drag the fluid with them as they move down.
DDSP-based Neural Waveform Synthesis of Polyphonic Guitar Performance from String-wise MIDI Input

We explore the use of neural synthesis for acoustic guitar from string-wise MIDI input. We propose four different systems and compare them with both objective metrics and subjective evaluation against natural audio and a sample-based baseline. We iteratively develop these four systems by making various considerations on the architecture and intermediate tasks, such as predicting pitch and loudness control features. We find that formulating the control feature prediction task as a classification task rather than a regression task yields better results. Furthermore, we find that our simplest proposed system, which directly predicts synthesis parameters from MIDI input performs the best out of the four proposed systems. Audio examples are available at https://erl-j.github. io/neural-guitar-web-supplement.
Addressing selection bias in cluster randomized experiments via weighting

In cluster randomized experiments, units are often recruited after the random cluster assignment, and data are only available for the recruited sample. Post-randomization recruitment can lead to selection bias, inducing systematic differences between the overall and the recruited populations, and between the recruited intervention and control arms. In this setting, we define causal estimands for the overall and the recruited populations. We first show that if units select their cluster independently of the treatment assignment, cluster randomization implies individual randomization in the overall population. We then prove that under the assumption of ignorable recruitment, the average treatment effect on the recruited population can be consistently estimated from the recruited sample using inverse probability weighting. Generally we cannot identify the average treatment effect on the overall population. Nonetheless, we show, via a principal stratification formulation, that one can use weighting of the recruited sample to identify treatment effects on two meaningful subpopulations of the overall population: units who would be recruited into the study regardless of the assignment, and units who would be recruited in the study under treatment but not under control. We develop a corresponding estimation strategy and a sensitivity analysis method for checking the ignorable recruitment assumption.
On Annihilators of Explicit Polynomial Maps

We study the algebraic complexity of annihilators of polynomials maps. In particular, when a polynomial map is `encoded by' a small algebraic circuit, we show that the coefficients of an annihilator of the map can be computed in PSPACE. Even when the underlying field is that of reals or complex numbers, an analogous statement is true. We achieve this by using the class VPSPACE that coincides with computability of coefficients in PSPACE, over integers. As a consequence, we derive the following two conditional results. First, we show that a VP-explicit hitting set generator for all of VP would separate either VP from VNP, or non-uniform P from PSPACE. Second, in relation to algebraic natural proofs, we show that proving an algebraic natural proofs barrier would imply either VP $\neq$ VNP or DSPACE($\log^{\log^{\ast}n} n$) $\not\subset$ P.
Automatic Data Visualization Generation from Chinese Natural Language Questions

Data visualization has emerged as an effective tool for getting insights from massive datasets. Due to the hardness of manipulating the programming languages of data visualization, automatic data visualization generation from natural languages (Text-to-Vis) is becoming increasingly popular. Despite the plethora of research effort on the English Text-to-Vis, studies have yet to be conducted on data visualization generation from questions in Chinese. Motivated by this, we propose a Chinese Text-to-Vis dataset in the paper and demonstrate our first attempt to tackle this problem. Our model integrates multilingual BERT as the encoder, boosts the cross-lingual ability, and infuses the $n$-gram information into our word representation learning. Our experimental results show that our dataset is challenging and deserves further research.
Pop Quiz! Do Pre-trained Code Models Possess Knowledge of Correct API Names?

Recent breakthroughs in pre-trained code models, such as CodeBERT and Codex, have shown their superior performance in various downstream tasks. The correctness and unambiguity of API usage among these code models are crucial for achieving desirable program functionalities, requiring them to learn various API fully qualified names structurally and semantically. Recent studies reveal that even state-of-the-art pre-trained code models struggle with suggesting the correct APIs during code generation. However, the reasons for such poor API usage performance are barely investigated. To address this challenge, we propose using knowledge probing as a means of interpreting code models, which uses cloze-style tests to measure the knowledge stored in models. Our comprehensive study examines a code model's capability of understanding API fully qualified names from two different perspectives: API call and API import. Specifically, we reveal that current code models struggle with understanding API names, with pre-training strategies significantly affecting the quality of API name learning. We demonstrate that natural language context can assist code models in locating Python API names and generalize Python API name knowledge to unseen data. Our findings provide insights into the limitations and capabilities of current pre-trained code models, and suggest that incorporating API structure into the pre-training process can improve automated API usage and code representations. This work provides significance for advancing code intelligence practices and direction for future studies. All experiment results, data and source code used in this work are available at \url{https://doi.org/10.5281/zenodo.7902072}.
For A More Comprehensive Evaluation of 6DoF Object Pose Tracking

Previous evaluations on 6DoF object pose tracking have presented obvious limitations along with the development of this area. In particular, the evaluation protocols are not unified for different methods, the widely-used YCBV dataset contains significant annotation error, and the error metrics also may be biased. As a result, it is hard to fairly compare the methods, which has became a big obstacle for developing new algorithms. In this paper we contribute a unified benchmark to address the above problems. For more accurate annotation of YCBV, we propose a multi-view multi-object global pose refinement method, which can jointly refine the poses of all objects and view cameras, resulting in sub-pixel sub-millimeter alignment errors. The limitations of previous scoring methods and error metrics are analyzed, based on which we introduce our improved evaluation methods. The unified benchmark takes both YCBV and BCOT as base datasets, which are shown to be complementary in scene categories. In experiments, we validate the precision and reliability of the proposed global pose refinement method with a realistic semi-synthesized dataset particularly for YCBV, and then present the benchmark results unifying learning&non-learning and RGB&RGBD methods, with some finds not discovered in previous studies.
Dimming the Lights: 2D Simulations of Deflagrations of Hybrid C/O/Ne White Dwarfs Using FLASH

The dimmest and most numerous outlier of the Type Ia supernova population, the Type Iax event, is increasingly being found in the results of observational campaigns. There is currently no single accepted model to describe these events. This 2D study explores the viability of modeling Type Iax events as a hybrid C/O/Ne white dwarf progenitor undergoing a deflagration using the multiphysics software FLASH. This hybrid was created using the stellar evolution code MESA, and its C-depleted core and mixed structure have demonstrated lower yields than traditional C/O progenitors in previous deflagration-to-detonation studies. To generate a sample, 30 “realizations” of this simulation were performed, the only difference being the shape of the initial match head used to start the deflagration. Consistent with earlier work, these realizations produce the familiar hot dense bound remnant surrounded by sparse ejecta. Our results indicate that the majority of the star remains unburned (∼70%) and bound (>90%). Our realizations produce total ejecta yields on the order of 10−2–10−1 M ☉, ejected 56Ni yields on the order of 10−4–10−2 M ☉, and ejecta kinetic energies on the order of 1048–1049 erg. Compared to yields inferred from recent observations of the dimmest Type Iax events—SN 2007qd, SN 2008ha, SN 2010ae, SN 2019gsc, SN 2019muj, SN 2020kyg, and SN 2021fcg—our simulation produces comparable 56Ni yields but too-small total yields and kinetic energies. Reignition of the remnant is also seen in some realizations.
Evaluation of organic growth promoters on yield of dryland vegetable crops in India.

A cost-benefit analysis was made of the effect of three organic growth-promoters on yield and quality of two vegetable crops, brinjal (Solanum melonogena) and tomato (Lycopersicon esculentum), grown under field conditions. Traditional Ayurvedic growth-promoters, Panchagavya and Amrit Pani, were compared with Bokashi made using Effective Microorganisms (EM) technology. The results indicate higher yield and lower glycoalkaloid content in Bokashi-treated crops, followed by Panchagavya. Panchagavya was the most cost-effective growth-promoter followed by Amrit Pani and then Bokashi. We recommend the use of Panchagavya as an organic growth-promoter for small and marginally profitable vegetable-crop farmers.
Lost options commitment: how short-term policies affect long-term scope of action

We propose to explore the sustainability of climate policies based on a novel commitment metric. This metric allows to quantify how future generations' scope of action is affected by short-term climate policy. In an example application, we show that following a moderate emission scenario like SSP2-4.5 could commit future generations to heavily rely on carbon dioxide removal or/and solar radiation modification to avoid unmanageable sea level rise.
Learning to Warm-Start Fixed-Point Optimization Algorithms

We introduce a machine-learning framework to warm-start fixed-point optimization algorithms. Our architecture consists of a neural network mapping problem parameters to warm starts, followed by a predefined number of fixed-point iterations. We propose two loss functions designed to either minimize the fixed-point residual or the distance to a ground truth solution. In this way, the neural network predicts warm starts with the end-to-end goal of minimizing the downstream loss. An important feature of our architecture is its flexibility, in that it can predict a warm start for fixed-point algorithms run for any number of steps, without being limited to the number of steps it has been trained on. We provide PAC-Bayes generalization bounds on unseen data for common classes of fixed-point operators: contractive, linearly convergent, and averaged. Applying this framework to well-known applications in control, statistics, and signal processing, we observe a significant reduction in the number of iterations and solution time required to solve these problems, through learned warm starts.
Spatiotemporal modelling of PM$_{2.5}$ concentrations in Lombardy (Italy) -- A comparative study

This study presents a comparative analysis of three predictive models with an increasing degree of flexibility: hidden dynamic geostatistical models (HDGM), generalised additive mixed models (GAMM), and the random forest spatiotemporal kriging models (RFSTK). These models are evaluated for their effectiveness in predicting PM$_{2.5}$ concentrations in Lombardy (North Italy) from 2016 to 2020. Despite differing methodologies, all models demonstrate proficient capture of spatiotemporal patterns within air pollution data with similar out-of-sample performance. Furthermore, the study delves into station-specific analyses, revealing variable model performance contingent on localised conditions. Model interpretation, facilitated by parametric coefficient analysis and partial dependence plots, unveils consistent associations between predictor variables and PM$_{2.5}$ concentrations. Despite nuanced variations in modelling spatiotemporal correlations, all models effectively accounted for the underlying dependence. In summary, this study underscores the efficacy of conventional techniques in modelling correlated spatiotemporal data, concurrently highlighting the complementary potential of Machine Learning and classical statistical approaches.
On the interpretation and significance of bias metrics in texts: a PMI-based approach

In recent years, the use of word embeddings has become popular to measure the presence of biases in texts. Despite the fact that these measures have been shown to be effective in detecting a wide variety of biases, metrics based on word embeddings lack transparency, explain-ability and interpretability. In this study, we propose a PMI-based metric to quantify biases in texts. We show that this metric can be approximated by an odds ratio, which allows estimating the conﬁdence interval and statistical signiﬁcance of textual bias. We also show that this PMI-based measure can be expressed as a function of conditional probabilities, providing a simple interpretation in terms of word co-occurrences. Our approach produces a performance comparable to GloVe-based and Skip-gram-based metrics in experiments of gender-occupation and gender-name associations. We discuss the advantages and disadvantages of using methods based on ﬁrst-order vs second-order co-occurrences, from the point of view of the interpretability of the metric and the sparseness of the data.
MuLaN: a MultiLayer Networks Alignment Algorithm

A Multilayer Network (MN) is a system consisting of several topological levels (i.e., layers) representing the interactions between the system's objects and the related interdependency. Therefore, it may be represented as a set of layers that can be assimilated to a set of networks of its own objects, by means inter-layer edges (or inter-edges) linking the nodes of different layers; for instance, a biological MN may allow modeling of inter and intra interactions among diseases, genes, and drugs, only using its own structure. The analysis of MNs may reveal hidden knowledge, as demonstrated by several algorithms for the analysis. Recently, there is a growing interest in comparing two MNs by revealing local regions of similarity, as a counterpart of Network Alignment algorithms (NA) for simple networks. However, classical algorithms for NA such as Local NA (LNA) cannot be applied on multilayer networks, since they are not able to deal with inter-layer edges. Therefore, there is the need for the introduction of novel algorithms. In this paper, we present MuLaN, an algorithm for the local alignment of multilayer networks. We first show as proof of concept the performances of MuLaN on a set of synthetic multilayer networks. Then, we used as a case study a real multilayer network in the biomedical domain. Our results show that MuLaN is able to build high-quality alignments and can extract knowledge about the aligned multilayer networks. MuLaN is available at https://github.com/pietrocinaglia/mulan.
Adaptive Prompt Learning with Distilled Connective Knowledge for Implicit Discourse Relation Recognition

Implicit discourse relation recognition (IDRR) aims at recognizing the discourse relation between two text segments without an explicit connective. Recently, the prompt learning has just been applied to the IDRR task with great performance improvements over various neural network-based approaches. However, the discrete nature of the state-art-of-art prompting approach requires manual design of templates and answers, a big hurdle for its practical applications. In this paper, we propose a continuous version of prompt learning together with connective knowledge distillation, called AdaptPrompt, to reduce manual design efforts via continuous prompting while further improving performance via knowledge transfer. In particular, we design and train a few virtual tokens to form continuous templates and automatically select the most suitable one by gradient search in the embedding space. We also design an answer-relation mapping rule to generate a few virtual answers as the answer space. Furthermore, we notice the importance of annotated connectives in the training dataset and design a teacher-student architecture for knowledge transfer. Experiments on the up-to-date PDTB Corpus V3.0 validate our design objectives in terms of the better relation recognition performance over the state-of-the-art competitors.
Probability weighted four-point arc imaging algorithm for time-reversed lamb wave damage detection

Damage imaging based on scattering signals of ultrasonic Lamb waves in plate structure is considered as one of the most effective ways for structural health monitoring area. To improve location accuracy and reduce the impact of artifacts, a probability weighted four-point arc imaging algorithm for time reversal Lamb wave damage detection is proposed in this paper. By taking the defect as a secondary wave source, the four-point arc positioning method is used to calculate the propagation time of the signal from transducer to defect. And the amplitude of damage signal corresponding to the time of flight is used for imaging. In order to eliminate the artifacts, a damage probability weighting is combined with four-point circular arc imaging algorithm. The effectiveness of the proposed method is experimentally verified in aluminum plate. Experimental results indicate that damage location accuracy and imaging quality has been improved in both single-flaw and double-flaw samples compared with conventional delay-and-sum method.
Assessing cognitive function among older adults using machine learning and wearable device data: a feasibility study

Timely implementation of interventions to slow cognitive decline among older adults requires accurate monitoring to detect changes in cognitive function. Data gathered using wearable devices that can continuously monitor factors known to be associated with cognition could be used to train machine learning models and develop wearable-based cognitive monitoring systems. Using data from over 2,400 older adults in the National Health and Nutrition Examination Survey (NHANES) we developed prediction models to differentiate older adults with normal cognition from those with poor cognition based on outcomes from three cognitive tests measuring different domains of cognitive function. During repeated cross-validation, CatBoost, XGBoost, and Random Forest models performed best when predicting cognition based on processing speed, working memory, and attention (median AUCs>0.82) compared to immediate and delayed recall (median AUCs>0.72) and categorical verbal fluency (median AUC>0.68). Activity and sleep parameters were also more strongly associated with processing speed, working memory, and attention compared to other cognitive subdomains. Our work provides proof of concept that wearable-based cognitive monitoring systems may be a viable alternative to traditional methods for monitoring processing speeds, working memory, and attention. We further identified novel metrics that could be targets in future causal studies seeking to better understand how sleep and activity parameters influence cognitive function among older adults.
Energy-resolved spin correlation measurements: Decoding transverse spin dynamics in weakly interacting Fermi gases

We study transverse spin dynamics on a microscopic level by measuring energy-resolved spin correlations in weakly interacting Fermi gases (WIFGs). The trapped cloud behaves as a many-body spin-lattice in energy space with effective long-range interactions, simulating a collective Heisenberg model. We observe the flow of correlations in energy space in this quasi-continuous system, revealing the connection between the evolution of the magnetization and the localization or spread of correlations. This work highlights energy-space correlation as a new observable in quantum phase transition studies of WIFGs, decoding system features that are hidden in macroscopic measurements.