Single Benchmark Research Articles

Dataset of human skin and fingernails images for non-invasive haemoglobin level assessment

Anaemia, a decrease in total concentration of haemoglobin (Hb) in blood, affects substantial percentage of the population worldwide. Currently, the gold standard for determining the Hb level is the invasive analysis of venous blood. Yet, more and more research groups demonstrate the possibility of non-invasive Hb assessment using white light imaging of tissue sites where Hb is the main chromophore, in particular, fingernails. Despite the promising declarations, non-invasive Hb assessment via RGB-imaging is still poorly used in practice. The main reason is the difficulty in establishing the true accuracy of the methods presented in different works since they are tested on private datasets collected under different experimental conditions. Here we present an open dataset containing RGB images of skin and fingernails for patients with a known level of Hb, thus providing a single benchmark for researchers and engineers in the field, aimed at fostering translation of non-invasive imaging methods to the bedside.

Benchmark-based deviation and drawdown measures in portfolio optimization

Understanding and modeling of agent’s risk/reward preferences is a central problem in various applications of risk management including investment science and portfolio theory in particular. One of the approaches is to axiomatically define a set of performance measures and to use a benchmark to identify a particular measure from that set by either inverse optimization or functional dominance. For example, such a benchmark could be the rate of return of an existing attractive financial instrument. This work introduces deviation and drawdown measures that incorporate rates of return of indicated financial instruments (benchmarks). For discrete distributions and discrete sample paths, portfolio problems with such measures are reduced to linear programs and solved based on historical data in cases of a single benchmark and three benchmarks used simultaneously. The optimal portfolios and corresponding benchmarks have similar expected/cumulative rates of return in sample and out of sample, but the former are considerably less volatile.

Enabling efficient regional seismic fragility assessment of multi‐component bridge portfolios through Gaussian process regression and active learning

AbstractRegional seismic fragility assessment of bridge portfolios must address the embedded uncertainties and variations stemming from both the earthquake hazard and bridge attributes (e.g., geometry, material, design detail). To achieve bridge‐specific fragility assessment, multivariate probabilistic seismic demand models (PSDM) have recently been developed that use both the ground motion intensity measure and bridge parameters as inputs. However, explicitly utilizing bridge parameters as inputs requires numerous nonlinear response history analyses (NRHAs). In this situation, the associated computational cost increases exponentially for high‐fidelity bridge models with complex component connectivity and sophisticated material constitutive laws. Moreover, it remains unclear how many analyses are sufficient for the response data and the resulting demand model to cover the entire solution space without overfitting. To deal with these issues, this study integrates Gaussian process regression (GPR) and active learning (AL) into a multistep workflow to achieve efficient regional seismic fragility assessment of bridge portfolios. The GPR relaxes the probability distribution assumptions made in typical cloud analysis‐based PSDMs to enable heteroskedastic nonparametric seismic demand modeling. The AL leverages the varying standard deviation to select the least but most representative bridge‐model‐ground‐motion sample pairs to conduct NRHA with much‐improved efficiency. Both independent and correlated multi‐output GPRs are proposed to deal with bridge portfolios with seismic demand correlations among multiple components (column, bearing, shear key, abutment, unseating, and joint seal). Considering a single benchmark highway bridge class in California as the case study, the AL‐GPR framework and the associated component‐level fragility results are investigated in terms of their efficiency, accuracy, and robustness. The fragility results show that 70 AL‐selected samples would enable the GPR to derive bridge‐specific fragility models comparable to the ones using the multiple stripes analysis approach with 1950 ground motions considered for each individual bridge. The AL‐GPR model also successfully captures the physics of how bridge span length, deck area, column slenderness, and steel reinforcement ratio would change the damage state exceedance probabilities of different bridge components. The efficiency of AL stems from the fact that, with the multi‐output independent GPR, a stable and reliable fragility model can be achieved using 50 AL‐selected samples compared to at least 270 randomly chosen samples. The proposed methodology advances the state of the art in enabling more efficient and reliable regional seismic fragility assessment of multi‐component bridge portfolios.

Evaluating the relationship between contouring variability and modelled treatment outcome for prostate bed radiotherapy.

Objectives.Contouring similarity metrics are often used in studies of inter-observer variation and automatic segmentation but do not provide an assessment of clinical impact. This study focused on post-prostatectomy radiotherapy and aimed to (1) identify if there is a relationship between variations in commonly used contouring similarity metrics and resulting dosimetry and (2) identify the variation in clinical target volume (CTV) contouring that significantly impacts dosimetry.Approach.The study retrospectively analysed CT scans of 10 patients from the TROG 08.03 RAVES trial. The CTV, rectum, and bladder were contoured independently by three experienced observers. Using these contours reference simultaneous truth and performance level estimation (STAPLE) volumes were established. Additional CTVs were generated using an atlas algorithm based on a single benchmark case with 42 manual contours. Volumetric-modulated arc therapy (VMAT) treatment plans were generated for the observer, atlas, and reference volumes. The dosimetry was evaluated using radiobiological metrics. Correlations between contouring similarity and dosimetry metrics were calculated using Spearman coefficient (Γ). To access impact of variations in planning target volume (PTV) margin, the STAPLE PTV was uniformly contracted and expanded, with plans created for each PTV volume. STAPLE dose-volume histograms (DVHs) were exported for plans generated based on the contracted/expanded volumes, and dose-volume metrics assessed.Mainresults. The study found no strong correlations between the considered similarity metrics and modelled outcomes. Moderate correlations (0.5 <Γ< 0.7) were observed for Dice similarity coefficient, Jaccard, and mean distance to agreement metrics and rectum toxicities. The observations of this study indicate a tendency for variations in CTV contraction/expansion below 5 mm to result in minor dosimetric impacts.Significance. Contouring similarity metrics must be used with caution when interpreting them as indicators of treatment plan variation. For post-prostatectomy VMAT patients, this work showed variations in contours with an expansion/contraction of less than 5 mm did not lead to notable dosimetric differences, this should be explored in a larger dataset to assess generalisability.

Stochastic Arbitrage Opportunities: Set Estimation and Statistical Testing

We provide a formal statistical theory of consistent estimation of the set of all arbitrage portfolios that meet the description of being a stochastic arbitrage opportunity. Two empirical likelihood ratio tests are developed: one for the null that a given arbitrage portfolio is qualified, and another for the alternative that the portfolio is not qualified. Apart from considering generalized concepts and hypotheses based on multiple host portfolios, the statistical assumption framework is also more general than in earlier studies that focused on special cases with a single benchmark portfolio. Various extensions and generalizations of the theory are discussed. A Monte Carlo simulation study shows promising statistical size and power properties for testing the null, for representative data dimensions. The results of an empirical application illustrate the importance of selecting a proper blocking structure and moment estimation method.

Statistical time-series forecast error and bias assessment using hold-out samples and a single benchmark (data-reduction) scoring metric

In Time-Series (TS) forecast modeling, we utilize a Hold-Out (HO) sample to assess a candidate model forecast error and bias, with the Mean Absolute Percentage Error (MAPE) as a single benchmark (data-reduction) for a scoring metric. The purpose of such HO sampling is to assess error rates and accuracy (unbiasedness) level whether the forecasted values of a candidate TS model is within a pre-specified (targeted) margin-of-error (MOE) rate of α-percent. For instance, for an accuracy expectation of 80% level, the MOE rate of α is tolerated to be, 20%. If the MAPE of a candidate TS model is less than the MOE rate of α, then the model is considered reasonably accurate enough. Otherwise, we select the next available candidate TS model with the smallest-possible MAPE. For an illustration, we apply such method to a TS sales-data example.

Development of an Approach for Image Forgery Detection Using Machine Learning Algorithms

Digital picture fraud detection is an increasing societal necessity due to the importance of verified images. The detection of picture copying, splicing, retouching, and re-sampling forgeries is included. In the absence of digital signatures or watermarks, passive picture authentication may serve as an alternative to active authentication. Passive techniques, every so often recognized as blind techniques, could take place without preceding knowledge of the picture or its reference. Identifying counterfeiting picture or tampering was a research field for long a period of time, triggered via the Internet, online platforms, social messaging platforms, and extensive digital image usage. The rate of failure could be a key factor for examining the alteration of picture or forgery, among other existing methods. The research applies almost six common algorithms related to machine learning in order to extract features from Lightweight, Spatial Exploitation, and Residual deep learning models on benchmark datasets MICC-F220, Columbia, and CoMoFoD. The models of incorporated deep learning could consist of AlexNet, GoogleNet, VGG16, VGG19, SqueezeNet, MobileNetV2, ShuffleNet, ResNet-18, ResNet-50, and ResNet-101 for spatial exploitation. Fine-tuning is applied to the top three deep learning models, optimizing hyperparameters centered on indicators of performance for every single benchmark dataset. Tweaked SqueezeNet, MobileNetV2, and ShuffleNet deep learning models with SGDM Optimizer and SVM classifier yielded the best results for MICC-F220 dataset. Fine-tuned VGG19, MobileNetV2, and ResNet-50 deep learning models with SGDM Optimizer and SVM v classifier yielded the best results for Columbia dataset. In CoMoFoD dataset, fine-tuned AlexNet, MobileNetV2, and ShuffleNet deep learning models with SGDM Optimizer and SVM classifier yielded the best results. The proposed approach, utilizing machine learning algorithms and deep learning features, enhanced forgery detection and reduced false positives. Results were validated on benchmark image forgery datasets and compared to current methods.

A Hybrid Deep Learning GRU based Approach for Text Classification using Word Embedding

Text categorization has become an increasingly important issue for businesses that handle massive volumes of data generated online, and it has found substantial use in the field of NLP. The capacity to group texts into separate categories is crucial for users to effectively retain and utilize important information. Our goal is to improve upon existing recurrent neural network (RNN) techniques for text classification by creating a deep learning strategy through our study. Raising the quality of the classifications made is the main difficulty in text classification, nevertheless, as the overall efficacy of text classification is often hampered by the data semantics' inadequate context sensitivity. Our study presents a unified approach to examine the effects of word embedding and the GRU on text classification to address this difficulty. In this study, we use the TREC standard dataset. RCNN has four convolution layers, four LSTM levels, and two GRU layers. RNN, on the other hand, has four GRU layers and four LSTM levels. One kind of recurrent neural network (RNN) that is well-known for its comprehension of sequential data is the gated recurrent unit (GRU). We found in our tests that words with comparable meanings are typically found near each other in embedding spaces. The trials' findings demonstrate that our hybrid GRU model is capable of efficiently picking up word usage patterns from the provided training set. Remember that the depth and breadth of the training data greatly influence the model's effectiveness. Our suggested method performs remarkably well when compared to other well-known recurrent algorithms such as RNN, MV-RNN, and LSTM on a single benchmark dataset. In comparison to the hybrid GRU's F-measure 0.952, the proposed model's F-measure is 0.982%. We compared the performance of the proposed method to that of the three most popular recurrent neural network designs at the moment RNNs, MV-RNNs, and LSTMs, and found that the new method achieved better results on two benchmark datasets, both in terms of accuracy and error rate.

Generative models for two-ground-truth partitions in networks.

A myriad of approaches have been proposed to characterize the mesoscale structure of networks most often as a partition based on patterns variously called communities, blocks, or clusters. Clearly, distinct methods designed to detect different types of patterns may provide a variety of answers' to the networks mesoscale structure. Yet even multiple runs of a given method can sometimes yield diverse and conflicting results, producing entire landscapes of partitions which potentially include multiple (locally optimal) mesoscale explanations of the network. Such ambiguity motivates a closer look at the ability of these methods to find multiple qualitatively different "ground truth" partitions in a network. Here we propose the stochastic cross-block model (SCBM), a generative model which allows for two distinct partitions to be built into the mesoscale structure of a single benchmark network. We demonstrate a use case of the benchmark model by appraising the power of stochastic block models (SBMs) to detect implicitly planted coexisting bicommunity and core-periphery structures of different strengths. Given our model design and experimental setup, we find that the ability to detect the two partitions individually varies by SBM variant and that coexistence of both partitions is recovered only in a very limited number of cases. Our findings suggest that in most instances only one-in some way dominating-structure can be detected, even in the presence of other partitions. They underline the need for considering entire landscapes of partitions when different competing explanations exist and motivate future research to advance partition coexistence detection methods. Our model also contributes to the field of benchmark networks more generally by enabling further exploration of the ability of new and existing methods to detect ambiguity in the mesoscale structure of networks.

Testing Inferences about Language Contact on Morphosyntax: A Typological Case Study on Alorese–Adang Contact

AbstractWhen linguists make inferences about language contact, control data is required for reliable analysis. Historical data or reconstructions are typically used for that purpose. However, historical data is globally mostly unavailable, and reconstructions are laborious if comparing outcomes of language contact in a typological way. We assess a recent typological proposal (Di Garbo &amp; Napoleão de Souza 2023) that argues that using a single language, called Benchmark language, can serve as a viable control for making inferences about contact. To evaluate this approach, we use as a case study a documented contact situation in Eastern Indonesia between the Austronesian language Alorese and the Papuan language Adang. We sample languages related to Alorese and use computational phylogenetic methods for ancestral reconstruction to analyse if using a single Benchmark produces deviating inferences about contact compared to using Bayesian ancestral reconstructions. Additionally, we test for isolation by distance effects by analysing if the probability of contact effects correlates with increasing geographic distance from the contact region. The results suggest that no isolation by distance effects exist in the data and that none of the single Benchmarks significantly deviate from the ancestral reconstructions.

Challenges in benchmarking whole-life GHG emissions from renovation cases: Evidence from 23 real-life cases

While political initiatives focus on energy efficiency to reduce greenhouse gas emissions (GHGe), there is currently a lack of knowledge about GHGe from energy-efficiency measures versus other renovation measures. Recognizing the multitude of purposes and functions in play within real-life renovations is central to the ongoing development in benchmarking and regulating the life-cycle GHGe of building projects, to ultimately limit emissions from the growing number of renovation projects. This study therefore investigates lifecycle-based GHGe from the multitude of changed functions in 23 real-life cases of renovation and considers how the results contribute to discussions on benchmarking renovation projects. The results show that, from a lifecycle perspective, energy efficiency actions in renovation produced operational savings of around 50 % from 13.5 kg CO2-eq/m2/year to 7.0 kg CO2-eq/m2/year on average, indicating the significance of reducing the energy demand of buildings. The material-related, embodied GHGe contributed to an average of 2.8 kg CO2-eq/m2/year in the 23 renovation cases. A remarkable 54 % of these lifecycle-embodied impacts from the renovation cases are associated with other functions than energy efficiency, such as spatial adjustments, changes in interior layout, or the construction of balconies. The results contribute to discussions of three benchmarking approaches suggested in literature. First, single benchmarks for the whole building. This approach does not encompass the large variation in impacts and functions that are showcased in the renovation cases. Second, benchmarks on a smaller scale, such as building elements. This approach can be explored further, and the study provides pointers to the significance of different elements. Finally, benchmarks based on GHGe “savings” from energy reductions. The approach only considers one function and not the significance of the multitude of other functions added in renovation projects.

Leaf classification on Flavia dataset: A detailed review

For decades, vision scientists have contemplated the topic of plant species classification. As plants are of great importance to medicinal research, they are utilized in a wide range of medications. Plants are required in a variety of ways in order to save the species from extinction and provide an abundance of food through agriculture. Therefore,Botanists and computer scientists must conduct extensive plant species research. The plant resources are necessary for the survival of the world’s nations The purpose of this paper is to examine the frequently utilized and publicly accessible dataset for plant classification in the past. We explored over 200 research papers for a deep understanding of the area. Briefly described are the procedural advancements and developments in the field of leaf classification. All the major techniques with significant advancements, the new effective approaches, and the novel techniques are discussed in this research. For the benefit of future researchers, the findings, research gap and transition, and coherence of algorithms in terms of several measurements are underlined. The hundreds of publications on a single benchmark dataset illustrate the progression of the recognition process, improvements, and innovations.

Time Series Dataset Survey for Forecasting with Deep Learning

Deep learning models have revolutionized research fields like computer vision and natural language processing by outperforming traditional models in multiple tasks. However, the field of time series analysis, especially time series forecasting, has not seen a similar revolution, despite forecasting being one of the most prominent tasks of predictive data analytics. One crucial problem for time series forecasting is the lack of large, domain-independent benchmark datasets and a competitive research environment, e.g., annual large-scale challenges, that would spur the development of new models, as was the case for CV and NLP. Furthermore, the focus of time series forecasting research is primarily domain-driven, resulting in many highly individual and domain-specific datasets. Consequently, the progress in the entire field is slowed down due to a lack of comparability across models trained on a single benchmark dataset and on a variety of different forecasting challenges. In this paper, we first explore this problem in more detail and derive the need for a comprehensive, domain-unspecific overview of the state-of-the-art of commonly used datasets for prediction tasks. In doing so, we provide an overview of these datasets and improve comparability in time series forecasting by introducing a method to find similar datasets which can be utilized to test a newly developed model. Ultimately, our survey paves the way towards developing a single widely used and accepted benchmark dataset for time series data, built on the various frequently used datasets surveyed in this paper.

Optimal power flow solution with current injection model of generalized interline power flow controller using ameliorated ant lion optimization

&lt;span lang="EN-US"&gt;Optimal power flow (OPF) solutions with generalized interline power flow controller (GIPFC) devices play an imperative role in enhancing the power system’s performance. This paper used a novel ant lion optimization (ALO) algorithm which is amalgamated with Lévy flight operator, and an effectual algorithm is proposed named as, ameliorated ant lion optimization (AALO) algorithm. It is being implemented to solve single objective OPF problem with the latest flexible alternating current transmission system (FACTS) controller named as GIPFC. GIPFC can control a couple of transmission lines concurrently and it also helps to control the sending end voltage. In this paper, current injection modeling of GIPFC is being incorporated in conventional Newton-Raphson (NR) load flow to improve voltage of the buses and focuses on minimizing the considered objectives such as generation fuel cost, emissions, and total power losses by fulfilling equality, in-equality. For optimal allocation of GIPFC, a novel Lehmann-Symanzik-Zimmermann (LSZ) approach is considered. The proposed algorithm is validated on single benchmark test functions such as Sphere, Rastrigin function then the proposed algorithm with GIPFC has been testified on standard IEEE-30 bus system.&lt;/span&gt;

Comparison of Novel Hybrid and Benchmark Machine Learning Algorithms to Predict Groundwater Potentiality: Case of a Drought-Prone Region of Medjerda Basin, Northern Tunisia

Water scarcity is a severe problem in Tunisia, particularly in the northern region crossed by the Medjerda River, where groundwater is a conjoint water resource that is increasingly exploited. The aim of this study is to delineate the groundwater potential zones (GWPZs) in the Lower Valley of the Medjerda basin by using single benchmark machine learning models based on artificial neural network (ANN), random forest (RF), and support vector regression (SVR), and by developing a novel hybrid method, NB-RF-SVR, to reach the highest accuracy of groundwater potential prediction. Each model produced a spatial groundwater potential map (GPM) with the input of 26 groundwater-related factors (GRF) selected by the frequency ratio model and 70% of the transmissivity training data. The models’ effectiveness was assessed using the AUC-ROC curve, sensitivity, specificity, MAE, and RMSE metric indicators. The validation findings revealed that all the models performed successfully for the GWPZ mapping, where the AUC values for the ANN, RF, SVR, and NB-RF-SVR models were estimated as 71%, 79%, 87%, and 92%, respectively. The relative importance of the GWPZs revealed that land use followed by geology and elevation were the most important factors. Finally, these outcomes can provide valuable information for decision makers to effectively manage groundwater in water-stressed regions.

Forecasting wind speed using a reinforcement learning hybrid ensemble model: a high-speed railways strong wind signal prediction study in Xinjiang, China

Abstract Considering the application of wind-forecasting technology along the railway, it becomes an effective means to reduce the risk of train derailment and overturning. Accurate prediction of crosswinds can provide scientific guidance for safe train operation. To obtain more reliable wind-speed prediction results, this study proposes an intelligent ensemble forecasting method for strong winds along the high-speed railway. The method consists of three parts: the data preprocessing module, the hybrid prediction module and the reinforcement learning ensemble module. First, fast ensemble empirical model decomposition (FEEMD) is used to process the original wind speed data. Then, Broyden-Fletcher-Goldfarb-Shanno (BFGS) method, non-linear autoregressive network with exogenous inputs (NARX) and deep belief network (DBN), three benchmark predictors with different characteristics are employed to build prediction models for all the sublayers of decomposition. Finally, Q-learning is utilized to iteratively calculate the combined weights of the three models, and the prediction results of each sublayer are superimposed to obtain the model output. The real wind speed data of two railway stations in Xinjiang are used for experimental comparison. Experiments show that compared with the single benchmark model, the hybrid ensemble model has better accuracy and robustness for wind speed prediction along the railway. The 1-step forecasting results mean absolute error (MAE), mean absolute percentage error (MAPE) and root mean square error (RMSE) of Q-learning-FEEMD-BFGS-NARX-DBN in site #1 and site #2 are 0.0894 m/s, 0.6509%, 0.1146 m/s, and 0.0458 m/s, 0.2709%, 0.0616 m/s, respectively. The proposed ensemble model is a promising method for railway wind speed prediction.

A Data-Characteristic-Driven Decomposition Ensemble Forecasting Research on the Demand of Space Science Payload Components

In order to solve the problem of long product lead time, accurate demand forecasting for space science payload components is of great significance to the development of China’s space science industry. In view of the unsteady, nonlinear, and small sample characteristics of space science payload component demand, this paper proposes the EEMD-CC&amp;CV-MPSO-SVR model to predict the future demand of space science payload components. First, this paper effectively adopts EEMD to decompose the normalized demand sequence and analyze the stationarity of each subsequence. The sequence complexity is distinguished by sample entropy, and the optimum kernel function CC-MPSO-SVR and CV-MPSO-SVR prediction models are established for high-complexity and low-complexity sequences, respectively. Finally, the prediction results of each subsequence are ensemble to form a total prediction. Experimental results shows that the model proposed in this paper performs better than single benchmark models and other hybrid models in terms of prediction performance and robustness. It can effectively predict the quantity and trend of the demand for China’s space science payload components, which provide decision-making basis for the government to formulate policies, demand-side procurement, and supply-side inventory control.

Cross-Comparison of Individual Tree Detection Methods Using Low and High Pulse Density Airborne Laser Scanning Data

Numerous individual tree detection (ITD) methods have been developed for use with airborne laser scanning (ALS) data to provide tree-scale forest inventories across large spatial extents. Despite the growing number of methods, relatively few have been comparatively assessed using a single benchmark forest inventory validation dataset, limiting their operational application. In this study, we assessed seven ITD methods, representing three common approaches (point-cloud-based, raster-based, hybrid), across coniferous forest stands with diverse structure and composition to understand how ITD and height measurement accuracy vary with method, input parameters and data, and stand density. There was little variability in accuracy between the ITD methods where the average F-score and standard deviation (±SD) were 0.47 ± 0.03 using a lower pulse density ALS dataset with an average of 8 pulses per square meter (ppm2) and 0.50 ± 0.02 using a higher pulse density ALS dataset with an average of 22 ppm2. Using higher ALS pulse density data produced higher ITD accuracies (F-score increase of 10–13%) in some of the methods versus more modest gains in other methods (F-score increase of 1–3%). Omission errors were strongly related with stand density and largely consisted of suppressed trees underneath the dominant canopy. Simple canopy height model (CHM)-based methods that utilized fixed-size local maximum filters had the lowest omission errors for trees across all canopy positions. ITD accuracy had large intra-method variation depending on input parameters; however, the highest accuracies were obtained when parameters such as search window size and spacing thresholds were equal to or less than the average crown diameter of trees in the study area. All ITD methods produced height measurements for the detected trees that had low RMSE (&lt;1.1 m) and bias (&lt;0.5 m). Overall, the results from this study may help guide end-users with ITD method application and highlight future ITD method improvements.

Compilation Forking: A Fast and Flexible Way of Generating Data for Compiler-Internal Machine Learning Tasks

Compiler optimization decisions are often based on hand-crafted heuristics centered around a few established benchmark suites. Alternatively, they can be learned from feature and performance data produced during compilation. However, data-driven compiler optimizations based on machine learning models require large sets of quality data for training in order to match or even outperform existing human-crafted heuristics. In static compilation setups, related work has addressed this problem with iterative compilation. However, a dynamic compiler may produce different data depending on dynamically-chosen compilation strategies, which aggravates the generation of comparable data. We propose compilation forking, a technique for generating consistent feature and performance data from arbitrary, dynamically-compiled programs. Different versions of program parts with the same profiling and compilation history are executed within single program runs to minimize noise stemming from dynamic compilation and the runtime environment. Our approach facilitates large-scale performance evaluations of compiler optimization decisions. Additionally, compilation forking supports creating domain-specific compilation strategies based on machine learning by providing the data for model training. We implemented compilation forking in the GraalVM compiler in a programming-language-agnostic way. To assess the quality of the generated data, we trained several machine learning models to replace compiler heuristics for loop-related optimizations. The trained models perform equally well to the highly-tuned compiler heuristics when comparing the geometric means of benchmark suite performances. Larger impacts on few single benchmarks range from speedups of 20% to slowdowns of 17%. The presented approach can be implemented in any dynamic compiler. We believe that it can help to analyze compilation decisions and leverage the use of machine learning into dynamic compilation.

A comprehensive LFQ benchmark dataset on modern day acquisition strategies in proteomics

In the last decade, a revolution in liquid chromatography-mass spectrometry (LC-MS) based proteomics was unfolded with the introduction of dozens of novel instruments that incorporate additional data dimensions through innovative acquisition methodologies, in turn inspiring specialized data analysis pipelines. Simultaneously, a growing number of proteomics datasets have been made publicly available through data repositories such as ProteomeXchange, Zenodo and Skyline Panorama. However, developing algorithms to mine this data and assessing the performance on different platforms is currently hampered by the lack of a single benchmark experimental design. Therefore, we acquired a hybrid proteome mixture on different instrument platforms and in all currently available families of data acquisition. Here, we present a comprehensive Data-Dependent and Data-Independent Acquisition (DDA/DIA) dataset acquired using several of the most commonly used current day instrumental platforms. The dataset consists of over 700 LC-MS runs, including adequate replicates allowing robust statistics and covering over nearly 10 different data formats, including scanning quadrupole and ion mobility enabled acquisitions. Datasets are available via ProteomeXchange (PXD028735).