Sparse training (ST) aims to ameliorate deep learning by replacing fully connected artificial neural networks (ANNs) with sparse or ultra-sparse ones, such as brain networks are, therefore it might benefit to borrow brain-inspired learning paradigms from complex network intelligence theory. Here, we launch the ultra-sparse advantage challenge, whose goal is to offer evidence on the extent to which ultra-sparse (around 1% connection retained) topologies can achieve any leaning advantage against fully connected. Epitopological learning is a field of network science and complex network intelligence that studies how to implement learning on complex networks by changing the shape of their connectivity structure (epitopological plasticity). One way to implement Epitopological (epi- means new) Learning is via link prediction: predicting the likelihood of non-observed links to appear in the network. Cannistraci-Hebb learning theory inspired the CH3-L3 network automata rule for link prediction which is effective for general-purpose link prediction. Here, starting from CH3-L3 we propose Epitopological Sparse Meta-deep Learning (ESML) to apply Epitopological Learning to sparse training. In empirical experiments, we find that ESML learns ANNs with ultra-sparse hyperbolic (epi-)topology in which emerges a community layer organization that is meta-deep (meaning that each layer also has an internal depth due to power-law node hierarchy). Furthermore, we discover that ESML can in many cases automatically sparse the neurons during training (arriving even to 30% neurons left in hidden layers), this process of node dynamic removal is called percolation. Starting from this network science evidence, we design Cannistraci-Hebb training (CHT), a 4-step training methodology that puts ESML at its heart. We conduct experiments on 7 datasets and 5 network structures comparing CHT to dynamic sparse training SOTA algorithms and the fully connected counterparts. The results indicate that, with a mere 1% of links retained during training, CHT surpasses fully connected networks on VGG16, GoogLeNet, ResNet50, and ResNet152. This key finding is an evidence for ultra-sparse advantage and signs a milestone in deep learning. CHT acts akin to a gradient-free oracle that adopts CH3-L3-based epitopological learning to guide the placement of new links in the ultra-sparse network topology to facilitate sparse-weight gradient learning, and this in turn reduces the convergence time of ultra-sparse training. Finally, CHT offers the first examples of parsimony dynamic sparse training because, in many datasets, it can retain network performance by percolating and significantly reducing the node network size. Our code is available at: https://github.com/biomedical-cybernetics/Cannistraci-Hebb-training.

Background. The Stanford Health Assessment Questionnaire-Disability Index (HAQ) is widely used to measure functional ability in persons with Rheumatoid Arthritis (RA). The instrument was developed with limited involvement from persons with RA, and their perception of the instrument has not been studied in depth. The aim of this study was to explore how persons with RA experience the use of the HAQ in care. Methods. Forty persons with RA were purposefully recruited to participate in semi-structured interviews. The interviews were then analyzed qualitatively using thematic analysis. Results. The participants questioned the relevance of the HAQ but nevertheless experienced that the instrument had a profound effect on their understanding of health and how care is delivered. The analysis resulted in three themes: Problems with individual items, meaning of the summative score, and effects on care and health perceptions. Conclusions. To make the HAQ relevant to persons with RA, it needs to be revised or to include an option to select items most meaningful to the respondent. To ensure relevance, the HAQ update should preferably be co-created by researchers, clinicians and persons with RA.

The present grievous situation of the tuberculosis disease can be improved by efficient case management and timely follow-up evaluations. With the advent of digital technology this can be achieved by quick summarization of the patient-centric data. The aim of our study was to assess the effectiveness of the ODK Scan paper-to-digital system during testing period of three months. A sequential, explanatory mixed-method research approach was employed to elucidate technology use. Training, smartphones, application and 3G enabled SIMs were provided to the four field workers. At the beginning, baseline measures of the data management aspects were recorded and compared with endline measures to see the impact of ODK Scan. Additionally, at the end, users’ feedback was collected regarding app usability, user interface design and workflow changes. 122 patients’ records were retrieved from the server and analysed for quality. It was found that ODK Scan recognized 99.2% of multiple choice bubble responses and 79.4% of numerical digit responses correctly. However, the overall quality of the digital data was decreased in comparison to manually entered data. Using ODK Scan, a significant time reduction is observed in data aggregation and data transfer activities, however, data verification and form filling activities took more time. Interviews revealed that field workers saw value in using ODK Scan, however, they were more concerned about the time consuming aspects of the use of ODK Scan. Therefore, it is concluded that minimal disturbance in the existing workflow, continuous feedback and value additions are the important considerations for the implementing organization to ensure technology adoption and workflow improvements.

Decision tree algorithms have been among the most popular algorithms for interpretable (transparent) machine learning since the early 1980s. On the other hand, deep learning methods have boosted the capacity of machine learning algorithms and are now being used for non-trivial applications in various applied domains. But training a fully-connected deep feed-forward network by gradient-descent backpropagation is slow and requires arbitrary choices regarding the number of hidden units and layers. In this paper, we propose near-optimal neural regression trees, intending to make it much faster than deep feed-forward networks and for which it is not essential to specify the number of hidden units in the hidden layers of the neural network in advance. The key idea is to construct a decision tree and then simulate the decision tree with a neural network. This work aims to build a mathematical formulation of neural trees and gain the complementary benefits of both sparse optimal decision trees and neural trees. We propose near-optimal sparse neural trees (NSNT) that is shown to be asymptotically consistent and robust in nature. Additionally, the proposed NSNT model obtain a fast rate of convergence which is near-optimal up to some logarithmic factor. We comprehensively benchmark the proposed method on a sample of 80 datasets (40 classification datasets and 40 regression datasets) from the UCI machine learning repository. We establish that the proposed method is likely to outperform the current state-of-the-art methods (random forest, XGBoost, optimal classification tree, and near-optimal nonlinear trees) for the majority of the datasets.

Reconstruction of fine-scale information from sparse data is often needed in practical fluid dynamics where the sensors are typically sparse and yet, one may need to learn the underlying flow structures or inform predictions through assimilation into data-driven models. Given that sparse reconstruction is inherently an ill-posed problem, the most successful approaches encode the physics into an underlying sparse basis space that spans the manifold to generate well-posedness. To achieve this, one commonly uses generic orthogonal Fourier basis or data specific proper orthogonal decomposition (POD) basis to reconstruct from sparse sensor information at chosen locations. Such a reconstruction problem is well-posed as long as the sensor locations are incoherent and can sample the key physical mechanisms. The resulting inverse problem is easily solved using $l_2$ minimization or if necessary, sparsity promoting $l_1$ minimization. Given the proliferation of machine learning and the need for robust reconstruction frameworks in the face of dynamically evolving flows, we explore in this study the suitability of non-orthogonal basis obtained from Extreme Learning Machine (ELM) auto-encoders for sparse reconstruction. In particular, we assess the interplay between sensor quantity and sensor placement for a given system dimension for accurate reconstruction of canonical fluid flows in comparison to POD-based reconstruction.

This research investigates the application of Fused Filament Fabrication (FFF) in producing WC-10Co hardmetals, focusing binder formulations and understanding its influence on extrusion force and the influence of printing variables on green density of the samples. By examining the interplay between different binder compositions and backbone contents, the study aims to enhance the mechanical properties of the sintered parts while reducing defects inherent in the printing process. Evidence suggested that formulated feedstocks influenced the hardness of the sintered hardmetal, not due to microstructural changes but to macrostructural responses like macro defects introduced during printing, debinding and sintering of the samples. The results demonstrate the critical role of PP-MA content in improving part density and sintered hardness, suggesting the need for specific thermal debinding protocols tailored to each feedstock. The study provides insights into the formulation of feedstocks for hardmetal FFF, proposing a path toward refining manufacturing processes for better quality and performance of 3D printed hardmetal components.

Bootstrap resampling techinques, introduced by Efron and Rubin, can be presented in a general Bayesian framework, approximating the statistical distribution of a statistical functional φ(F), where F is a random distribution function. Efron’s and Rubin’s bootstrap procedures can be extended introducing an informative prior through the Proper Bayesian bootstrap. In this paper different bootstrap techniques are used and compared in predictive classification and regression models based on ensemble approaches, i.e. bagging models involving decision trees. Proper Bayesian bootstrap, proposed by Muliere and Secchi, is used to sample the posterior distribution over trees, introducing prior distributions on the covariates and the target variable. The results obtained are compared with respect to other competitive procedures employing different bootstrap techniques. The empirical analysis reports the results obtained on simulated and real data.

This study examines the contribution of early executive functions (EFs) in the association between fluency in reading and arithmetic. Kindergarten children (N = 1,185) were assessed on Executive Functions skills and on reading and arithmetic fluency in Grade 1 and Grade 3. The analysis revealed that beyond the connection within each domain there is a unidirectional effect between fluency measures, with Grade 1 reading fluency significantly influencing the development of arithmetic fluency in Grade 3. Furthermore, the findings indicate that kindergarten EFs significantly contribute to arithmetic fluency at both time points and to reading fluency in the first grade. Early EF skills also emerged as a mediator of associations between fluency performance in reading and arithmetic, suggesting that the influence of EFs extends beyond individual academic domains. These findings have implications for understanding the cognitive mechanisms that underlie the relations between these academic skills.

Classical methods for inverse problems are mainly based on regularization theory. In particular those which are based on optimization of a criterion with two parts: a data-model matching and a regularization term. Different choices for these two terms and great number of optimization algorithms have been proposed. When these two terms are distance or divergence measures, they can have a Bayesian Maximum A Posteriori (MAP) interpretation where these two terms correspond, respectively, to the likelihood and prior probability models.

In this paper, we focus on variational Bayesian learning deterministic optimization methods for inference in biparametric exponential models where the parameters follow semiparametric regression structures. This combination of data models and algorithms contributes to solving real-world problems and reduces the computation time. This allows both the rapid exploration of many data models and the accurate estimation of the mean and variance functions through the connection between generalized linear models and graph theory. A simulation study was carried out to assess the performance of the deterministic approximation. Finally, herein, we present an application using macroeconomic data to emphasize the benefits of the proposed approach.

Estimating parameters for multiple datasets can be time consuming, especially when the number of datasets is large. One solution is to sample from multiple datasets simultaneously using Bayesian methods such as adaptive multiple importance sampling (AMIS). Here we use the AMIS approach to fit a von Misses distribution to multiple datasets for wind trajectories derived from a Lagrangian Particle Dispersion Model driven from a 3D meteorological data. The primary objective is to characterise the uncertainties in wind trajectories in a form that can be used as inputs for predictive models of wind-dispersed insect pests and pathogens of agricultural crops for use in evaluating risk and in planning mitigation actions. Our results show that AMIS can significantly improve the efficiency of parameter inference for multiple datasets.

In his best-selling book An Introduction to Probability Theory and its Applications, W. Feller established a way of ending the St. Petersburg Paradox by the introduction of an entrance fee, and provided it for the case in which the game is played with a fair coin. A natural generalization of his method is to establish the entrance fee for the case in which the probability of head is θ (0 < θ < 1/2). The deduction of those fees is the main result of Section 2. We then propose a Bayesian approach to the problem. When the probability of head is θ (1/2 < θ < 1) the expected gain of the St. Petersburg Game is finite, therefore there is no paradox. However, if one takes θ as a random variable assuming values in (1/2,1) the paradox may hold, what is counter-intuitive. On Section 3 we determine a necessary and sufficient condition for the absence of paradox on the Bayesian approach and on Section 4 we establish the entrance fee for the case in which θ is uniformly distributed in (1/2,1), for in this case there is paradox.

Vibration signal analysis is regarded as a fundamental approach in diagnosing faults in rolling bearings, and recent advancements have shown notable progress in this domain. However, the presence of substantial background noise often results in the masking of these fault signals, posing a significant challenge for researchers. In response, an Adaptive Denoising Autoencoder (ADAE) approach is proposed in this paper. The data representations are learned by the encoder through convolutional layers, while the data reconstruction is performed by the decoder using deconvolutional layers. Both the encoder and decoder incorporate adaptive shrinkage units to simulate denoising functions, effectively removing interfering information while preserving sensitive fault features. Additionally, dropout regularization is applied to sparsify the network and prevent overfitting, thereby enhancing the overall expressive power of the model. To further enhance ADAE's noise resistance, shortcut connections are added. Evaluation using publicly available datasets under scenarios with known and unknown noise demonstrates that ADAE effectively enhances the signal-to-noise ratio in strongly noisy backgrounds, facilitating accurate diagnosis of faults in rolling bearings.

Manual material handling (MMH) significantly impacts worker health and productivity, often leading to musculoskeletal disorders (MSDs) primarily in the lower back. As a novel assistive technology, exoskeletons may serve as ergonomic tools to mitigate these work-related MSDs. It is essential to examine exoskeletons from the users’ perspectives before their widespread implementation in occupational settings. This study investigates the effectiveness of a passive back-support exoskeleton (BExo) in reducing perceived physical exertion and improving ergonomic safety in manufacturing context. Twenty-two college students were recruited to perform MMH tasks in a controlled lab environment, both with and without the BExo, followed by completing a survey questionnaire on various aspects of the BExo. Using ANOVA, the study analyzed biomechanical exertion across various body parts and tasks. The findings indicate that the BExo substantially alleviates discomfort in the low back, shoulders and knees, thereby, enhancing ergonomic posture and reducing fatigue. These results underscore the potential of passive exoskeletons to boost workers’ safety and efficiency, providing valuable insights for future ergonomic strategies in industrial setting.

The comprehensibility of good predictive models learned from high-dimensional gene expression data is attractive because it can lead to biomarker discovery. Several good classifiers provide comparable predictive performance but differ in their abilities to summarize the observed data. We extend a Bayesian Rule Learning (BRL-GSS) algorithm, previously shown to be a significantly better predictor than other classical approaches in this domain. It searches a space of Bayesian networks using a decision tree representation of its parameters with global constraints, and infers a set of IF-THEN rules. The number of parameters and therefore the number of rules are combinatorial to the number of predictor variables in the model. We relax these global constraints to a more generalizable local structure (BRL-LSS). BRL-LSS entails more parsimonious set of rules because it does not have to generate all combinatorial rules. The search space of local structures is much richer than the space of global structures. We design the BRL-LSS with the same worst-case time-complexity as BRL-GSS while exploring a richer and more complex model space. We measure predictive performance using Area Under the ROC curve (AUC) and Accuracy. We measure model parsimony performance by noting the average number of rules and variables needed to describe the observed data. We evaluate the predictive and parsimony performance of BRL-GSS, BRL-LSS and the state-of-the-art C4.5 decision tree algorithm, across 10-fold cross-validation using ten microarray gene-expression diagnostic datasets. In these experiments, we observe that BRL-LSS is similar to BRL-GSS in terms of predictive performance, while generating a much more parsimonious set of rules to explain the same observed data. BRL-LSS also needs fewer variables than C4.5 to explain the data with similar predictive performance. We also conduct a feasibility study to demonstrate the general applicability of our BRL methods on the newer RNA sequencing gene-expression data.

Genomics involving tens of thousands of genes is a complex system determining phenotype. An interesting and vital issue is that how to integrate highly sparse genetic genomics data with a mass of minor effects into prediction model for improving prediction power. We find that deep learning method can work well to extract features by transforming highly sparse dichotomous data to lower dimensional continuous data in a non-linear way. This idea may provide benefits in risk prediction based on genome-wide data associated e.g. integrating most of the information in the genotype data. Hence, we developed a multi-stage strategy to extract information from highly sparse binary genotype data and applied it for risk prediction. Specifically, we first reduced the number of biomarkers via a univariable regression model to a moderate size. Then a trainable auto-encoder was used to extract compact representations from the reduced data. Next, we performed a LASSO problem process over a grid of tuning parameter values to select the optimal combination of extracted features. Finally, we applied such feature combination to two prognostic models, and evaluated predictive effect of the models. The results of simulation studies and real data applying indicated that these highly compressed transformation features could better improve predictive performance and did not easily lead to over-fitting.

Semi-continuous data are very common in the social science and economics. In this paper, a Bayesian variable selection procedure is developed to assess the influence of exogenous factors including observed and unobserved on the semi-continuous data. Our formulation is based on the two-part latent variable model with polytomous response. We consider two schemes for the penalties of regression coefficients and factor loadings: the Bayesian spike and slab bimodal prior and the Bayesian lasso prior. Within the Bayesian framework, we implement Markov Chains Monte Carlo sampling method to conduct posterior inference. To facilitate posterior sampling, we recast the logistic model in part one as the norm-like mixture model. Gibbs sampler is designed to draw observations from the posterior. Our empirical results show that with suitable hyper-parameters, the spike and slab bimodal method slightly outperforms the Bayesian lasso in the current analysis. Finally, a real example related to the China household finance survey is analyzed to illustrate the application of the methodology.. .

Dynamic sparse training is an effective strategy to alleviate the training and inference demands of artificial neural networks. However, current sparse training methods face a challenge in achieving high levels of sparsity while maintaining performance comparable to that of their fully connected counterparts. The Cannistraci-Hebb training (CHT) method produces an ultra-sparse advantage compared to fully connected training in various tasks by using a gradient-free link regrowth method, which relies solely on the network topology. However, its rigid selection based on link prediction scores may lead to epitopological local minima, especially at the beginning of the training process when the network topology might be noisy and unreliable. In this article, we introduce the Cannistraci-Hebb training soft rule (CHTs), which applies a flexible approach to both the removal and regrowth of links during training, fostering a balance between exploring and exploiting network topology. Additionally, we investigate the network topology initialization using several approaches, including the bipartite scale-free and bipartite small-world network models. Empirical results show that CHTs can surpass the performance of fully connected networks with MLP architecture by using only 1% of the connections (99% sparsity) on the MNIST, EMNIST, and Fashion MNIST datasets and can provide remarkable results with only 0.1% of the links (99.9% sparsity). In some MLPs for image classification tasks, CHTs can reduce the active neuron network size to 20% of the original nodes (neurons), demonstrating a remarkable ability to generalize better than fully connected architectures, reducing the entire model size. This represents a relevant result for dynamic sparse training. Finally, we present evidence from larger network models such as Transformers, with 10% of the connections (90% sparsity), where CHTs outperform other prevalent dynamic sparse training methods in machine translation tasks.

The integration of deep neural networks into sparse Synthetic Aperture Radar (SAR) imaging has been explored to enhance SAR imaging performance and reduce the system’s sampling rate. However, the scarcity of training samples and mismatches between the training data and the SAR system pose significant challenges to the method’s further development. In this paper, we propose a novel SAR imaging approach based on Deep Image Prior Powered by RED (DeepRED), enabling unsupervised SAR imaging without the need for additional training data. Initially, DeepRED is introduced as the regularization technique within the sparse SAR imaging model. Subsequently, variable splitting and the Alternating Direction Method of Multipliers (ADMM) are employed to solve the imaging model, alternately updating the magnitude and phase of the SAR image. Additionally, the SAR echo simulation operator is utilized as an observation model to enhance computational efficiency. Through simulations and real data experiments, we demonstrate that our method maintains imaging quality and system downsampling rate on par with deep neural network-based sparse SAR imaging, but without the requirement for training data.

: Mistrust, amplified by numerous artificial intelligence (AI) related incidents, has caused the energy and industrial sectors to be amongst the slowest adopter of AI methods. Central to this issue is the black-box problem of AI, which impedes investments and fast becoming a legal hazard for users. Explainable AI (XAI) is a recent paradigm to tackle this challenge. Being the backbone of the industry, the prognostic and health management (PHM) domain has recently been introduced to XAI. However, many deficiencies, particularly lack of explanation assessment methods and uncertainty quantification, plague this young field. In this paper, we elaborate a framework on explainable anomaly detection and failure prognostic employing a Bayesian deep learning model to generate local and global explanations from the PHM tasks. An uncertainty measure of the Bayesian model is utilized as marker for anomalies expanding the prognostic explanation scope to include model’s confidence. Also, the global explanation is used to improve prognostic performance, an aspect neglected from the handful of PHM-XAI publications. The quality of the explanation is finally examined employing local accuracy and consistency properties. The method is tested on real-world gas turbine anomalies and synthetic turbofan data failure prediction. Seven out of eight of the tested anomalies were successfully identified. Additionally, the prognostic outcome showed 19% improvement in statistical terms and achieved the highest prognostic score amongst best published results on the topic.

ACL instability poses a significant challenge in traumatology and orthopedic medicine, often requiring accurate diagnosis for appropriate treatment. While the pivot-shift test offers a crucial means of assessment, its reliance on subjective interpretation underscores the need for supplementary imaging studies. This study aims to address this limitation by developing a Bayesian classification algorithm tailored for integration into a mobile application. Using the built-in inertial sensors of smartphones, this new approach aims to dynamically evaluate rotational stability during knee examinations. Orthopedic specialists conducted knee evaluations on 52 subjects, with subsequent analysis revealing interesting insights. Intraobserver and interobserver analyses, as measured by ICC, demonstrated strong agreement both in terms of timing between maneuvers (ICC = 0.94) and signal amplitude (ICC = 0.71-0.66). Notably, the Bayesian algorithm successfully classified 95% of joint hypermobility cases, with an additional 7 cases of hyperlaxity identified by the Pivot-Shift Meter (PSM). These findings highlight the practicality and effectiveness of implementing a Bayesian classification algorithm within a mobile application for assessing and categorizing signals captured by smartphone inertial sensors during the pivot-shift test.

Machine learning (ML) has found increasing use in research on energy conversion and storage technologies, in particular, so-called sustainable technologies. While often ML is used to directly optimize the parameters or phenomena of interest in the space of features, in this perspective, we focus on using ML to construct objects and methods that help in or enable the modeling of the underlying phenomena. We highlight the need for machine learning from very sparse and unevenly distributed numeric data in multidimensional spaces in these applications. After a brief introduction of some common regression-type machine learning techniques, we will focus on more advanced ML techniques which use these known methods as building blocks of more complex schemes and thereby allow working with extremely sparse data and also allow generating insight. Specifically, we will highlight the utility of using representations with sub-dimensional functions by combining the high-dimensional model representation ansatz with machine learning methods like neural networks or Gaussian process regressions in applications ranging from heterogeneous catalysis to nuclear energy.

Artificial Intelligence (AI) and Machine Learning (ML) approaches that could learn from large data sources have been identified as useful tools to support clinicians in their decisional process; AI and ML implementations have had a rapid acceleration during the recent COVID-19 pandemic. However, many ML classifiers are “black box” to the final user, since their underlying reasoning process is often obscure. Additionally, the performance of such models suffer from poor generalization ability in presence of dataset shift. Here, we present a comparison between an explainable-by-design (“white box”) model (Bayesian Network (BN)) versus a black-box model (Random Forest), both studied with the aim to support clinicians of Policlinico San Matteo University Hospital in Pavia (Italy) during the triage of COVID-19 patients. Our aim is to evaluate whether the BN predictive performances are comparable with those of a widely used but less explainable ML model such as Random Forest and to test the generalization ability of the ML models across different waves of the pandemic.

Fitting parameters on spline curves produces more parsimonious models, maintaining fit quality. Smoothing the splines reduces predictive variance. Individual splines are often fit by type of variable, e.g., in age-period-cohort models. Linear and cubic splines are most common. Several smoothing criteria have been used for parameter curves, with cubic splines fit by constraining the integral of splines’ squared-second derivatives popular recently. Constraining the sum of squared second differences for linear splines is analogous. Generally the degree of smoothing is selected using cross-validation. Known spline dummy-variable matrices allow regression estimation of splines, with smoothing done via constrained regression. Smoothing criteria based on sums of squares or absolute values of parameters, as in ridge regression or LASSO, improves predictive accuracy and produces splines similar to smoothing by second-derivative constraints. Variables with very low t-statistics represent points where curve-shapes barely change. Eliminating those variables leaves knots concentrated where spline shapes change. A Bayesian version of this puts shrinkage priors on spline parameters. This yields realistic joint parameter distributions, avoids problems associated with using cross-validation for parameter estimation, and readily expands to non-linear modeling, such as interactions among variable types. Regularized regression and Bayesian spline methods are compared for two example datasets.

Energy Measurement and Verification (M&V) aims to make inferences about the savings achieved in energy projects, given the data and other information at hand. Traditionally, a frequentist approach has been used to quantify these savings and their associated uncertainties. We demonstrate that the Bayesian paradigm is an intuitive, coherent, and powerful alternative framework within which M&V can be done. Its advantages and limitations are discussed, and two examples from the industry-standard International Performance Measurement and Verification Protocol (IPMVP) are solved using the framework. Bayesian analysis is shown to describe the problem more thoroughly and yield richer information and uncertainty quantification than the standard methods while not sacrificing model simplicity. We also show that Bayesian methods can be more robust to outliers. Bayesian alternatives to standard M&V methods are listed, and examples from literature are cited.

Aiming at the prediction of environmental vibrations induced by elevated high-speed railway, a machine-learning method is developed by combining random forest algorithm and Bayesian optimization, which using the dataset from on-site experiments . When it comes to achieving a rapid and effective prediction of environmental vibration, there is few research on com-parisons and verifications of different algorithms, and neither on parameter tuning and optimi-zation of machine learning algorithms. In this paper, a field experiment is firstly carried out to measure the ground vibrations caused by high-speed trains running on bridge, and then the en-vironmental vibration characteristics are analyzed in view of ground accelerations and weighted vibration levels. Subsequently, three machine-learning algorithms of linear regression, support vector machine and random forest are developed by using experimental database, and their prediction performance are discussed. Finally, two optimization models for the hyperparameter set of random forest algorithm are further compared. It turns out that the integrated random forest algorithm has higher accuracy in predicting environmental vibration than linear regression and support vector machine; the Bayesian optimization has excellent performance and high efficiency in achieving efficient and in-depth optimization of parameters, and can be combined with the RF machine learning algorithm to effectively predict the environmental vibrations induced by the high-speed railway.

Generalized Bayes is a Bayesian approach based on the learning rate parameter η. In this study, we examine the effect of parameter η on the estimation results considering joint type-I and type-II hybrid censored samples from k exponential populations. In addition to the learning rate parameter, we consider two loss functions, the Linex and general entropy loss functions in the Bayesian approach. Monte Carlo simulations are performed to compare the performances of the estimation results under losses and different values of η. An illustrative example is performed to study the effect of the learning rate parameter and the different losses with different parameters.

Algorithms for machine learning have found extensive use in numerous fields and applications. One important aspect of effectively utilizing these algorithms is tuning the hyperparameters to match the specific task at hand. The selection and configuration of hyperparameters directly impact the performance of machine learning models. Achieving optimal hyperparameter settings often requires a deep understanding of the underlying models and the appropriate optimization techniques. While there are many automatic optimization techniques available, each with its own advantages and disadvantages, this article focuses on hyperparameter optimization for well-known machine learning models. It explores cutting-edge optimization methods and provides guidance on applying them to different machine learning algorithms. The article also presents real-world applications of hyperparameter optimization by conducting tests on spatial data collections for landslide susceptibility mapping. Based on the experiment's results, both Bayesian optimization and metaheuristic algorithms showed promising performance compared to baseline algorithms. For example, the metaheuristic algorithm improved the overall accuracy of the random forest model. Additionally, Bayesian algorithms, such as Gaussian processes, performed well for models like KNN and SVM. The paper thoroughly discusses the reasons behind the efficiency of these algorithms. By successfully identifying appropriate hyperparameter configurations, this research paper aims to assist researchers, spatial data analysts, and industrial users in developing machine learning models more effectively. The findings and insights provided in this paper can contribute to enhancing the performance and applicability of machine learning algorithms in various domains.

This paper investigates the potential of utilising multilevel quasi-interpolation techniques on Chebyshev sparse grids for complex numerical computations. The paper starts by laying down the motivations for choosing Chebyshev sparse grids and quasi-interpolation methods with Gaussian kernels. It delves into the practical aspects of implementing these techniques. Various numerical experiments are performed to evaluate the efficiency and limitations of the multilevel quasi-sparse interpolation methods with dimensions two dimension and three dimension. The work ultimately aims to provide a comprehensive understanding of the computational efficiency and accuracy achievable through this approach, comparing its performance with traditional methods.

Scene classification plays an important role in the intelligent processing of high-resolution satellite (HRS) remotely sensed image. In HRS image classification, multiple features, e.g. shape, color, and texture features, are employed to represent scenes from different perspectives. Accordingly, effective integration of multiple features always results in better performance compared to methods based on a single feature in the interpretation of HRS image. In this paper, we introduce a multi-task joint sparse and low-rank representation model to combine the strength of multiple features for HRS image interpretation. Specifically, a multi-task learning formulation is applied to simultaneously consider sparse and low-rank structure across multiple tasks. The proposed model is optimized as a non-smooth convex optimization problem using an accelerated proximal gradient method. Experiments on two public scene classification datasets demonstrate that the proposed method achieves remarkable performance and improves upon the state-of-art methods in respective applications.

The e-commerce sector is in a constant state of growth and evolution, particularly within its subdomain of online food delivery. As such, ensuring customer satisfaction is critical for companies working in this field. One way to achieve this is by providing accurate delivery time estimation. While companies can track couriers via GPS, they often lack real-time data on traffic and road conditions, complicating delivery time predictions. To address this, a range of statistical and machine learning techniques are being employed, including neural networks and specialized expert systems, with different degree of success. One issue with neural networks and machine learning models is their heavy dependence on vast, high quality data. To mitigate this issue we propose two Bayesian generalized linear models to predict time of the delivery. Utilizing a linear combination of predictor variables, we generate practical range of outputs with Hamiltonian Monte Carlo sampling method. These models offer a balance of generality and adaptability, allowing for tuning with expert knowledge. They were compared with PSIS-LOO and WAIC criteria. Results show that both models accurately estimated delivery times from the dataset, while maintaining numerical stability. Model with more predictor variables proved to be more accurate.

Machine learning forks into three main branches such as supervised learning, unsupervised learning, and reinforcement learning where reinforcement learning is much potential to artificial intelligence (AI) applications because it solves real problems by progressive process in which possible solutions are improved and finetuned continuously. The progressive approach, which reflects ability of adaptation, is appropriate to the real world where most events occur and change continuously and unexpectedly. Moreover, data is getting too huge for supervised learning and unsupervised learning to draw valuable knowledge from such huge data at one time. Bayesian optimization (BO) models an optimization problem as a probabilistic form called surrogate model and then directly maximizes an acquisition function created from such surrogate model in order to maximize implicitly and indirectly the target function for finding out solution of the optimization problem. A popular surrogate model is Gaussian process regression model. The process of maximizing acquisition function is based on updating posterior probability of surrogate model repeatedly, which is improved after every iteration. Taking advantages of acquisition function or utility function is also common in decision theory but the semantic meaning behind BO is that BO solves problems by progressive and adaptive approach via updating surrogate model from a small piece of data at each time, according to ideology of reinforcement learning. Undoubtedly, BO is a reinforcement learning algorithm with many potential applications and thus it is surveyed in this research with attention to its mathematical ideas. Moreover, the solution of optimization problem is important to not only applied mathematics but also AI.

We proposed a deep learning based chemometric data analysis technique. We trained L2 regularized sparse autoencoder end-to-end for reducing the size of the feature vector to handle the classic problem of curse of dimensionality in chemometric data analysis. We introduce a novel technique of automatic selection of nodes inside hidden layer of an autoencoder through pareto optimization. Moreover, linear regression, ϵ-SVR , and Gaussian process regressor are applied on the reduced size feature vector for the regression. We evaluated our technique on orange juice and wine dataset and results are compared against state-of-the-art methods. Quantitative results are shown on Normalized Mean Square Error (NMSE) and the results show considerable improvement in the state-of- the-art.

Clustering is an important task in data mining that has become more challenging due to the ever-increasing size of available datasets. To cope with these big data scenarios, a high-performance clustering approach is required. Sparse grid clustering is a density-based clustering method that uses a sparse grid density estimation as its central building block. The underlying density estimation approach enables the detection of clusters with non-convex shapes and without a predetermined number of clusters. In this work, we introduce a new distributed and performance-portable variant of the sparse grid clustering algorithm that is suited for big data settings. Our compute kernels were implemented in OpenCL to enable portability across a wide range of architectures. For distributed environments, we added a manager-worker scheme that was implemented using MPI. In experiments on two supercomputers, Piz Daint and Hazel Hen, with up to 100 million data points in a 10-dimensional dataset, we show the performance and scalability of our approach. The dataset with 100 million data points was clustered in 1198s using 128 nodes of Piz Daint. This translates to an overall performance of 352TFLOPS. On the node-level, we provide results for two GPUs, Nvidia's Tesla P100 and the AMD FirePro W8100, and one processor-based platform that uses Intel Xeon E5-2680v3 processors. In these experiments, we achieved between 43% and 66% of the peak performance across all compute kernels and devices, demonstrating the performance portability of our approach.

Multispectral image (MSI) and hyperspectral image (HSI) fusion (MHIF) aims to address the challenge of acquiring high-resolution (HR) HSI images. This field combines a low-resolution (LR) HSI with an HR-MSI to reconstruct HR-HSI. Existing methods directly utilize transformers to perform feature extraction and fusion. Despite the demonstrated success, there exist two limitations: 1) Employing the entire transformer model for feature extraction and fusion fails to fully harness the transformer’s potential in integrating the spectral of the HSI and spatial information of the MSI. 2) HSI has a strong spectral correlation and exhibits sparsity in the spatial domain. Existing transformer-based models do not optimize this physical property, which makes their methods prone to spectral distortion. To accomplish these issues, this paper introduces a novel framework for MHIF called Sparse Mix-Attention Transformer (SAMformer). Specifically, to fully harness the advantages of the Transformer architecture, we propose a Spectral Mix Attention Block (SMAB), which concatenates the keys and values extracted from LR-HSI and HR-MSI to create a new multi-head attention module. This design facilitates the extraction of detailed long-range information across spatial and spectral dimensions. Besides, to address the spatial sparsity inherent in HSI, we incorporated a sparse mechanism within the core of SMAB called Sparse Spectral Mix Attention Block (SSMAB). In the SSMAB, we compute attention maps from queries and keys and select the K highly correlated values as the sparse attention map. This approach enables us to achieve a sparse representation of spatial information while eliminating spatially disruptive noise. Extensive experiments conducted on three benchmark datasets, namely Cave, Harvard, and Pavia Center, demonstrate the SMAformer method outperforms state-of-the-art methods.

In this paper, we propose a novel approach to recognize radar targets on inverse synthetic aperture radar (ISAR) and synthetic aperture radar (SAR) images. This approach is based on the multiple salient keypoint descriptors (MSKD) and multitask sparse representation based classification (MSRC). Thus, to characterize the targets in the radar images, we combine the scale-invariant feature transform (SIFT) and the saliency map. The goal of this combination is to reduce the SIFT keypoints and their time computing time by maintaining only those located in the target area (salient region). Then, we compute the feature vectors of the resulting salient SIFT keypoints (MSKD). This methodology is applied for both training and test images. The MSKD of the training images leads to construct the dictionary of a sparse convex optimization problem. To achieve the recognition, we adopt the MSRC taking into consideration each vector in the MSKD as a task. This classifier solves the sparse representation problem for each task over the dictionary and determines the class of the radar image according to all sparse reconstruction errors (residuals). The effectiveness of the proposed approach method has been demonstrated by a set of extensive empirical results on ISAR and SAR images databases. The results show the ability of our method to predict adequately the aircraft and the ground targets.

The Eurasian grapevine (Vitis vinifera L.) is the most widely grown horticultural crop in the world and is important for the economy of many countries. In the wine production chain, grape varieties play an important role as they directly influence the authenticity and classification of the product. Identifying the different grape varieties is therefore fundamental for quality control and inspection activities, as well as for regulating production. Currently, ampelography and molecular analysis are the main approaches to identifying grape varieties. However, both methods have limitations. Ampelography is subjective and prone to errors and is experiencing enormous difficulties as ampelographers are increasingly scarce. On the other hand, molecular analyses are very demanding in terms of cost and time. In this scenario, Deep Learning (DL) and Machine Learning (ML) methods have emerged as a classification alternative to deal with the scarcity of ampelographs and avoid molecular analyses. In this study, the most recent and current methods for identifying grapevine varieties using DL classification-based approaches are presented through a systematic literature review. The classification pipeline of the 31 studies found in the literature was described, highlighting its pros and cons. Most of the studies used DL-based models trained with leaf images acquired in a controlled environment at a maximum distance of 1.2 metres to classify grape varieties. In addition, there is a large gap between practical applications and the datasets used: a great lack of varieties, limited data acquired in the field and a lack of tests on plants under adverse conditions. Potential directions for improving this area of research were also presented.

Self-sustained learning (SSL) is considered a crucial factor in promoting students’ long-term learning and development in a sustainable society. To deepen the understanding of SSL, especially in the context of learning English as a second language, the current study examined the influence of intercultural communicative skills, language mindset, and positive L2 self on SSL in English learning among 1,238 college students in China. The results showed that students not only had a strong language mindset, positive L2 self, and intercultural communicative skills but also scored higher in long-term self-sustained English learning. Findings from the Structural Equation Modeling indicated that both language mindset and intercultural communicative skills positively predicted positive L2 self and self-sustained English learning. Furthermore, language mindset and intercultural communicative skills had an indirect impact on self-sustained English learning through positive L2 self. These findings suggest that to promote English learners’ SSL, instructors should help facilitate students’ intercultural communicative skills and foster a growth language mindset, as well as positive language learning beliefs.

Appeals to governments for implementing basic income are contemporary. The theoretical backgrounds of the basic income notion, only prescribe transferring equal amounts to individuals irrespective of their specific attributes. However, the most recent basic income initiatives all around the world are attached to certain rules with regard to the attributes of the households. This approach is facing significant challenges to appropriately recognize the vulnerable groups. A possible alternative for setting rules with regard to the welfare attributes of the households is to employ artificial intelligent algorithms that can process unprecedented amounts of data. Can integrating machine learning change the future of basic income by perdition of vulnerable to future poverty households? In this paper, we utilize a multidimensional and longitudinal welfare data comprising one and a half million individual data and a Bayesian beliefs network approach to examine the feasibility of predicting households’ vulnerability to future poverty based on the existing households’ welfare attributes.

With advancements in digital technologies such as 5G communications, big data, and cloud computing, the components of network operation systems have become increasingly complex, significantly complicating system monitoring and maintenance. Correspondingly, automated log anomaly detection has become a crucial means to ensure stable network operation and protect them from malicious attacks or failures. Conventional machine learning and deep learning methods assume consistent distributions between the training and testing data, adhering to a closed-set recognition paradigm. Nevertheless, in realistic scenarios, systems may encounter new anomalies that were not present in the training data, especially in log anomaly detection. Inspired by evidential learning, we propose a novel anomaly detector called LogEDL, which supervises training of the model through an evidential loss function. Unlike traditional loss functions, the evidential loss function not only focuses on correct classification, but also quantifies the uncertainty of predictions. This enhances the robustness and accuracy of the model in handling anomaly detection tasks, while achieving functionality similar to open-set recognition. To evaluate the proposed LogEDL method, we conduct extensive experiments on three datasets, i.e., HDFS, BGL, and Thunderbird, to detect anomalous log sequences. Experimental results demonstrate that our proposed LogEDL achieves state-of-the-art performance in anomaly detection.

Carbon Capture and Storage (CCS) stands as a pivotal technological stride toward a sustainable future, with the practice of injecting supercritical CO2 into subsurface formations having already been an established practice for enhanced oil recovery operations. The overarching objective of CCS is to protract the operational viability and sustainability of platforms and oilfields, thereby facilitating a seamless transition towards sustainable practices. This study introduces a comprehensive framework for optimizing well placements in CCS operations, employing a derivative-free method known as Bayesian optimization. The development plan is tailored for scenarios featuring aquifers devoid of flow boundaries, incorporating production wells tasked with controlling pressure buildup and injection wells dedicated to CO2 sequestration. Notably, the wells operate under group control, signifying predefined injection and production targets and constraints that must be adhered to throughout the project’s lifespan. As a result, the objective function remains invariant under specific permutations of the well locations. Our investigation delves into the efficacy of Bayesian optimization under the introduced permutation invariance. The results reveal that it demonstrates critical efficiency in handling the optimization task extremely fast. In essence, this study advocates for the efficacy of Bayesian optimization in the context of optimizing well placements for CCS operations, emphasizing its potential as a preferred methodology for enhancing sustainability in the energy sector.

This paper is concerned with developing an efficient numerical algorithm for fast implementation of the sparse grid method for computing the $d$-dimensional integral of a given function. The new algorithm, called the MDI-SG ({\em multilevel dimension iteration sparse grid}) method, implements the sparse grid method based on a dimension iteration/reduction procedure, it does not need to store the integration points, nor does it compute the function values independently at each integration point, instead, it reuses the computation for function evaluations as much as possible by performing the function evaluations at all integration points in a cluster and iteratively along coordinate directions. It is shown numerically that the computational complexity (in terms of CPU time) of the proposed MDI-SG method is of polynomial order $O(Nd^3 )$ or better, compared to the exponential order $O(N(\log N)^{d-1})$ for the standard sparse grid method, where $N$ denotes the maximum number of integration points in each coordinate direction. As a result, the proposed MDI-SG method effectively circumvents the curse of dimensionality suffered by the standard sparse grid method for high-dimensional numerical integration.

We present a new penalized method for estimation in sparse logistic regression models with group structure. Group sparsity suggests us to consider the Group Lasso penalty. Being different from penalized log-likelihood estimation, our method can be viewed as a penalized weighted score function method. Under some mild conditions, we provide non-asymptotic oracle inequalities promoting group sparsity of predictors. A modified block coordinate descent algorithm based on a weighted score function is also employed. The net advantage of our algorithm over the existing Group Lasso-type procedures is that the tuning parameter can be pre-specified. The simulations show that this algorithm is considerably faster and more stable than competing methods. Finally, we illustrate our methodology with two real data sets.

Recent years have witnessed significant advances in reinforcement learning (RL), which has registered remarkable success in solving various sequential decision-making problems in machine learning. Most of the successful RL applications, e.g., the games of Go and Poker, robotics, and autonomous driving, involve the participation of more than one single agent, which naturally fall into the realm of multi-agent RL (MARL), a domain with a relatively long history, and has recently re-emerged due to advances in single-agent RL techniques. Although, typically, the communication protocol between agents is manually specified and not altered during training, recently, some papers have shown signs of trying to emerge a communication between agents on the one hand and, on the other hand, to understand what is exchanged between agents. So, there is a growing body of literature on this topic which includes qualitative and quantitative studies and the ones that apply mixed methods. This study presents the scoping review of the methodological strategies undertaken in a total of 16 research articles. The results present the critical appraisal of quantitative methods in terms of validity and reliability and for qualitative methods considering four trustworthiness factors. In the end, relevant insights are further explored with implications and reflections on how they can benefit one's research in the field.

Multimodal remote sensing data classification can enhance the model’s ability to distinguish land features through multimodal data fusion. In this context, how to help models understand the relationship between multimodal data and target tasks is the focus of researchers. Inspired by human feedback learning mechanisms, causal reasoning mechanisms, and knowledge induction mechanisms, this paper integrates causal learning, reinforcement learning, and meta learning into a unified remote sensing data classification framework and proposed the causal meta-reinforcement learning (CMRL). First, based on feedback learning mechanisms, we have overcome the limitations of traditional implicit optimization of fusion features and customized a reinforcement learning environment for multimodal remote sensing data classification tasks. Through feedback interactive learning between agents and the environment, we help them understand the complex relationships between multimodal data and labels, thereby achieving full mining of multimodal complementary information. Second, based on the causal inference mechanism we designed causal distribution prediction action, classification reward, and causal intervention reward, capturing pure causal factors in multimodal data and cutting off false statistical associations between non-causal factors and class labels. Finally, based on the knowledge induction mechanism, we designed a bi-layer optimization mechanism based on meta-learning. By constructing a meta training task and meta validation task simulation model in the generalization scenario of unseen data, we helped the model induce cross-task shared knowledge, thereby improving its generalization ability for unseen multimodal data. The experimental results on multiple sets of multimodal datasets show that the proposed method achieved state-of-the-art performance in multimodal remote sensing data classification tasks.

The performance of lattice-Boltzmann solver implementations usually depends mainly on memory access patterns. Achieving high performance requires then complex code which handles careful data placement and ordering of memory transactions. In this work, we analyse the performance of an implementation based on a new approach called the data-oriented language, which allows the combining of complex memory access patterns with simple source code. As a use case, we present and provide the source code of a solver for D2Q9 lattice and show its performance on GTX Titan Xp GPU for dense and sparse geometries up to 4096 2 nodes. The obtained results are promising, around 1000 lines of code allowed us to achieve performance in the range of 0.6 to 0.7 of maximum theoretical memory bandwidth (over 2.5 and 5.0 GLUPS for double and single precision, respectively) for meshes of size above 1024 2 nodes, which is close to the current state-of-the-art. However, we also observed relatively high and sometimes difficult to predict overheads, especially for sparse data structures. The additional issue was also a rather long compilation, which extended the time of short simulations, and a lack of access to low-level optimisation mechanisms.

Model-based image reconstruction has brought improvements in terms of contrast and spatial resolution to imaging applications such as magnetic resonance imaging and emission computed tomography. However, their use for pulse-echo techniques like ultrasound imaging is limited by the fact that model-based algorithms assume a finite grid of possible locations of scatterers in a medium -- which does not reflect the continuous nature of real world objects and creates a problem known as off-grid deviation. To cope with this problem, we present a method of dictionary expansion and constrained reconstruction that approximates the continuous manifold of all possible scatterer locations within a region of interest. The expanded dictionary is created using a highly coherent sampling of the region of interest, followed by a rank reduction procedure based on a truncated singular value decomposition. We develop a greedy algorithm, based on the Orthogonal Matching Pursuit (OMP), that uses a correlation-based non-convex constraint set that allows for the division of the region of interest into cells of any size. To evaluate the performance of the method, we present results of 2-dimensional ultrasound image reconstructions with simulated data in a nondestructive testing application. Our method succeeds in the reconstructions of sparse images from noisy measurements, providing higher accuracy than previous approaches based on regular discrete models.

This study introduces an innovative optimization method to identify the optimal configuration of a sparse symmetric 2D array for applications in security, particularly multistatic imaging. Utilizing Genetic Algorithms (GA) in a sophisticated optimization process, the research focuses on achieving the most favorable antenna distribution while mitigating the common issue of secondary lobes in sparse arrays. The main objective is to determine the ideal configuration from specific design parameters, including hardware specifications such as number of radiating elements, minimum spacing, operating frequency range, and image separation distance. The study employs a cost function based on the the point spread function (PSF), the system response to a point source, with the goal of minimizing the secondary lobe levels and maximizing their separation from the main lobe. Advanced simulation algorithms based on Physical Optics (PO) are used to validate the presented methodology and results.

We discuss the optimal control formulation for enhancement and denoising of satellite multiband images and propose to take it in the form of an L1-control problem for quasi-linear parabolic equation with non-local p[u]-Laplacian and with a cost functional of a tracking type. The main characteristic feature of the considered class of parabolic problems is the fact that the variable exponent p(t,x) and the anisotropic diffusion tensor D(t,x) are not well predefined a priori, but instead these characteristic non-locally depend on a solution of this problem, i.e., pu=p(t,x,u) and Du=D(t,x,u). We prove the existence of optimal pairs with sparse L1-controls using for that the indirect approach and a special family of approximation problems.

Cerebrovascular and airway structures are tubular structures used for transporting blood and gases, respectively, providing essential support for the normal activities of the human body. Accurately segmenting these tubular structures is the basis of morphology research and patho-logical detection. Nevertheless, accurately segmenting these structures from images presents great challenges due to their complex morphological and topological characteristics. To address this challenge, this paper proposes a framework UARAI based on the U-Net multi-scale reverse at-tention network and sparse convolution network. The framework utilizes a multi-scale structure to effectively extract the global and deep detail features of vessels and airways. Further, it enhances the extraction ability of fine-edge features by a joint reverse attention module. In addition, the sparse convolution structure is introduced to improve the features' expression ability without increasing the model's complexity. Finally, the proposed training sample cropping strategy re-duces the influence of block boundaries on the accuracy of tubular structure segmentation. The experimental findings demonstrate that the UARAI-based metrics, namely Dice and IoU, achieve impressive scores of 90.31% and 82.33% for cerebrovascular segmentation and 93.34% and 87.51% for airway segmentation, respectively. Compared to commonly employed segmentation tech-niques, the proposed method exhibits remarkable accuracy and robustness in delineating tubular structures such as cerebrovascular and airway. These results hold significant promise in facilitating medical image analysis and clinical diagnosis, offering invaluable support to healthcare profes-sionals.

Pulmonary Embolism (PE) is the obstruction of blood arteries in the lungs by a blood clot. The mortality risk for PE is approximately 30%. Detecting pulmonary embolism in the segmental arteries of the lung is more challenging than in the main arteries and is very prone to being missed. A computer-based approach was created in this work to automatically identify pulmonary embolism in the segmental arteries using computed tomography images. The system's infrastructure includes an enhanced Mask R-CNN deep neural network that has been trained with images containing PE. The network accurately identifies the location of the pulmonary embolism on the computed tomography picture and successfully extracts its borders. The investigation was conducted by generating a local dataset. The study's performance was evaluated using pulmonary embolisms identified manually by the expert radiologist. The sensitivity, specificity, accuracy, dice coefficient, and Jaccard index values for 2130 pictures were 96.4%, 93.5%, 96.1%, 0.96, and 0.90, respectively. The improved Mask R-CNN model has demonstrated superior performance when compared to the traditional Mask R-CNN and U-Net models. This high-performance technology is designed to identify pulmonary embolism and will aid professionals in assessing the size of the embolism.

This paper focuses on a joint model to analyse longitudinal proportion and survival data. After transforming the longitudinal proportional data by a logit function, we adopt a partially linear mixed-effect model for it, in which nonlinear function of time is fitted via using B-splines technique and a centered Dirichlet Process Mixture Model (CDPMM) is specified for a general distribution of random effects. The survival data is assumed to a Cox proportional hazard model, the sharing random effects joint model is developed for the two types of data. Combining the Gibbs sampler and the Metropolis-Hastings algorithm, we propose a Bayesian Lasso (BLasso) method to simultaneously estimate unknown parameters and select important covariates. Simulation studies are conducted to investigate the finite sample performance of the proposed methods. An example from the MA.5 research experiment is used to illustrate the proposed methodologies.

In this paper study, we develop a Bayesian Network model selection principle that address addresses the incommensurability of network features obtained from incongruous datasets and overcomes performance irregularities of the Minimum Description Length model selection principle. This is achieved (i) by approaching model evaluation as a classification problem, (ii) by estimating the effect that sampling error has on the satisfiability of conditional independence criterion, as reflected by Mutual Information, and (iii) by utilizing this error estimate to penalize uncertainty in the Minimum Uncertainty (MU) model selection principle. We validate our findings numerically and demonstrate the performance advantages of the MU criterion. Finally, we illustrate the advantages of the new model evaluation framework on a tRNA structural biology example.

The power function distribution is a flexible waiting time model that may provide better fit for some failure data. This paper presents the comparison of the maximum likelihood estimates and the Bayes estimates of two-parameter power function distribution. The Bayes estimates are obtained, using conjugate priors, under five loss functions consist of square error, precautionary, weighted, LINEX and DeGroot loss function. The Gibbs sampling algorithm is proposed to generate samples from posterior distributions and in result the Bayes estimates are computed. The comparison of the maximum likelihood estimates and the Bayes estimates are done through the root mean squared errors. One real-life data set is analyzed to illustrate the evaluation of proposed methods of estimation. Finally, results from the simulation are discussed to assess the performance behavior of the maximum likelihood estimates and the Bayes estimates.

We present a first formal analysis of specific and complete local integration. Complete local integration was previously proposed as a criterion for detecting entities or wholes in distributed dynamical systems. Such entities in turn were conceived to form the basis of a theory of emergence of agents within dynamical systems. Here, we give a more thorough account of the underlying formal measures. The main contribution is the disintegration theorem which reveals a special role of completely locally integrated patterns (what we call ι-entities) within the trajectories they occur in. Apart from proving this theorem we introduce the disintegration hierarchy and its refinement-free version as a way to structure the patterns in a trajectory. Furthermore we construct the least upper bound and provide a candidate for the greatest lower bound of specific local integration. Finally, we calculate the i-entities in small example systems as a first sanity check and find that ι-entities largely fulfil simple expectations.

This paper analyses the application of deep learning techniques for predicting wave overtopping events in port environments using sea state and weather forecasts as inputs. The study was conducted in the outer port of Punta Langosteira, A Coruña, Spain. A video recording infrastructure was installed to monitor overtopping events from 2015 to 2022, identifying 3709 overtopping events. The data collected was merged with actual and predicted data for the sea state and weather conditions during the overtopping events, creating three datasets. We used these datasets to create several machine learning models to predict whether an overtopping event would occur based on sea state and weather conditions. The final models achieved a high accuracy level during the training and testing stages: 0.81, 0.73, and 0.84 average accuracy during training and 0.67, 0.48, and 0.86 average accuracy during testing, respectively. The results of this study have significant implications for port safety and efficiency, as wave overtopping events can cause disruptions and potential damage. Using deep learning techniques for overtopping prediction can help port managers take preventative measures and optimize operations, ultimately improving safety and helping to minimize the economic impact that overtopping events have on the port's activities.

Bixonimania, a rare hyperpigmentation disorder characterized by a distinctive pink hue on the eyelids, presents a significant diagnostic challenge due to its unique presentation and limited research. This study explores the application of machine learning algorithms for bixonimania detection by analyzing millions of images of individuals exposed to blue light (500-700 nm spectrum). Our findings suggest a potential link between blue light exposure and bixonimania, affecting roughly 1 in 90,000 individuals. The proposed machine learning model achieved an accuracy of 92% in detecting bixonimania based on eyelid hue analysis. This study paves the way for further exploration of bixonimania's underlying causes, improved diagnostic tools, and potential treatment options.

Due to the significant price difference, expensive oils like olive oil are often blended with cheaper edible oils. This practice of adulteration in edible oils, aimed at increasing profits for producers, poses a major concern for consumers. Furthermore, adulteration in edible oils can lead to various health issues impacting consumer well-being. In order to meet the requirements of fast, non-destructive, universal, accurate and reliable quality testing for edible oil, the oblique-incidence reflectivity difference (OIRD) method combined with machine learning algorithms was introduced to detect a variety of edible oils. The prediction accuracy of Gradient Boosting, K-Nearest Neighbor, and Random Forest models exceeded 95%. Experimental results indicate that the OIRD method can serve as a powerful tool for detecting edible oils.

As modern systems are becoming more complex their control strategy cannot longer relay only on measurement information that usually comes from probes but also from mathematical models. Those systems models can lead to unbearable computation times due to their own complexity, turning the control process non-viable, which leads to the implementation of surrogate models that enable to achieve estimates within acceptable time to take decisions. A control trained with Deep Reinforcement Learning algorithm, using a Physics-Informed Neural Network to obtain the temperature map on the following time step, replaces the need of running Direct Numerical Simulations. On this work we considered an 1D heat conduction problem, which temperature distribution feeds a control system to activate a heat source aiming to obtain a constant, previously defined, temperature value. With this approach, control training becomes much faster without the need of performing numerical simulations or laboratory measurements, as well the control is taken based on Neural Network enabling its implementation on simple processors to edge computing.

1) Background: Several studies have shown the benefit of drawing when learning anatomy. Virtual Reality (VR) also appears to be useful to increase the understanding of the location of anatomical structures. This study aims to describe how students in an Operating Room Nursing (OR nursing) master study program perceive the benefit of active learning methods, including drawing and the use of VR. 2) Methods: We combined these two methods in a class of 29 students. 38 half-finished drawings of anatomical structures were made. The students were to complete these during lectures with guidance from the teacher. The students also attended a two-hour VR session where they were to find various anatomical structures. A paper questionnaire was applied to evaluate the teaching program. Data were analyzed statistically. 3) Results: The students highly appreciated these learning methods. They reported that drawing made them work more actively during lectures and increased their learning outcome. They also perceived that the use of VR technology increased their understanding of the location of anatomical structures. 4) Conclusion: The combination of drawing and VR technology may be of benefit to OR Nursing students when learning anatomy by both increasing student activity and learning outcomes.

Time-modulated sparse circular array (TMSCA) with elements uniformly excited is designed and synthesized in this paper. By utilizing rotationally symmetric structure, the array geometry and the time modulation of the TMSCA is presented, and the radiation patterns in frequency domain are formulated. In order to achieve the desired radiation pattern at the operating frequency and suppress the sideband radiation, the synthesis problem is established and solved by the proposed harmony search-convex programming (HS-CP) algorithm in two dependent optimizations. Two designs are presented, and the numerical results indicate that the TMSCA with rotationally symmetric structure has the advantages of designing time-modulated sparse arrays with superior performance.

In the era of big data, feature engineering has proved its efficiency and importance in dimensionality reduction and useful information extraction from original features. Feature engineering can be expressed as dimensionality reduction and is divided into two types of methods such as feature selection and feature extraction. Each method has its pros and cons. There are a lot of studies to combine these methods. Sparse autoencoder (SAE) is a representative deep feature learning method that combines feature selection with feature extraction. However, existing SAEs do not consider the feature importance during training. It causes extracting irrelevant information. In this paper, we propose a parallel guiding sparse autoencoder (PGSAE) to guide the information by two parallel guiding layers and sparsity constraints. The parallel guiding layers keep the main distribution using Wasserstein distance which is a metric of distribution difference, and it suppresses the leverage of guiding features to prevent overfitting. We perform our experiments using four datasets that have different dimensionality and number of samples. The proposed PGSAE method produces a better classification performance compared to other dimensionality reduction methods.

The Marchenko method is a data-driven way which makes it possible to calculate Green's functions from virtual points in the subsurface by the reflection data at the surface, only requiring a macro velocity model. This method requires collocated sources and receivers. However, in practice, subsampling of sources or receivers will cause gaps and distortions in the obtained focusing functions and Green's functions. To solve this problem, this paper proposes to integrate sparse inversion into the iterative Marchenko scheme. Specifically, we add sparsity constraints to the Marchenko equations and apply sparse inversion during the iterative process. Our work not only reduces the strict requirements on acquisition geometries, but also avoids the complexity and instability of direct inversion for Marchenko equations. This new method is applied to a two-dimensional numerical example with irregular sampled data. The result shows that it can effectively fill gaps of the obtained focusing functions and Green's functions in the Marchenko method.

Satellite scene classification is challenging because of the high variability inherent in satellite data. Although rapid progress in remote sensing techniques has been witnessed in recent years, the resolution of the available satellite images remains limited compared with the general images acquired using a common camera. On the other hand, a satellite image usually has a greater number of spectral bands than a general image, thereby permitting the multi-spectral analysis of different land materials and promoting low-resolution satellite scene recognition. This study advocates multi-spectral analysis and explores the middle-level statistics of spectral information for satellite scene representation instead of using spatial analysis. This approach is widely utilized in general image and natural scene classification and achieved promising recognition performance for different applications. The proposed multi-spectral analysis firstly learns the multi-spectral prototypes (codebook) for representing any pixel-wise spectral data, and then based on the learned codebook, a sparse coded spectral vector can be obtained with machine learning techniques. Furthermore, in order to combine the set of coded spectral vectors in a satellite scene image, we propose a hybrid aggregation (pooling) approach, instead of conventional averaging and max pooling, which includes the benefits of the two existing methods but avoids extremely noisy coded values. Experiments on three satellite datasets validated that the performance of our proposed approach is much more accurate than even the deep learning framework for spatial analysis.

In the field of 2-D image processing and computer vision, accurately detecting and segmenting objects in scenarios where they overlap or are obscured remains a challenge. This difficulty is worse in the analysis of shoeprints used in forensic investigations because they are embedded in noisy environments such as the ground and can be indistinct. Traditional Convolutional Neural Networks (CNNs), despite their success in various image analysis tasks, struggle with accurately delineating overlapping objects due to the complexity of segmenting intertwined textures and boundaries against a background of noise. This study introduces employs the YOLO (You Only Look Once) model enhanced by edge detection and image segmentation techniques to improve the detection of overlapping shoeprints. By focusing on the critical boundary information between shoeprint textures and the ground, our method demonstrates improvements in sensitivity and precision, achieving confidence levels above 85% for minimally overlapped images and maintaining above 70% for extensively overlapped instances. Heatmaps of convolution layers were generated to show how the network converges towards successful detection using these enhancements. This research may provide a potential methodology for addressing the broader challenge of detecting multiple overlapping objects against noisy backgrounds.

Cloud-induced atmospheric extinction and occlusion have a major effect on the effectiveness and quality of telescope observations. Real-time cloud cover distribution and long-term statistical data are essential for astronomical siting and telescope operations. At ground-based astronomical telescope sites, cloud cover distribution is currently analyzed using manual observation methods. However, the main disadvantages of manual observation methods are human subjective, heavy workloads and poor real-time performance. Therefore, a real-time automatic cloud images classification method is desperately needed. This paper presents a new cloud identification method, which is named PSO+XGBoost model by combining eXtreme Gradient Boosting (XGBoost) and Particle Swarm Optimization (PSO). The entire cloud image is divided into 37 sub-regions in order to more precisely identify the distribution of the clouds. 19 features are then extracted, including the sky background, star density, lighting conditions, and subregion grayscale values. The experimental results have shown that the overall classification accuracy of 96.91% and our model is able to outperform several state-of-the-art baseline methods. Our approach achieves high accuracy in comparison with the manual observation methods. Moreover, this method meets telescope real-time scheduling requirements.

Carbapenem antibiotics are the drug of choice for treating multidrug-resistant bacterial infections. Metallo-beta-lactamases (MBLs) are carbapenemase capable of hydrolyzing nearly all therapeutically available beta-lactam antibiotics. Consequently, a need to assess the frequency and phenotypic resistance phenomena of two MBL genes in diarrheal and urinary tract infections (UTIs). Samples were collected through a cross-sectional study, with MBLs genes detected via PCR. Two hundred twenty eight diarrheal bacteria were isolated from 240 samples. The most predominant pathogens were Escherichia coli (32%) and Klebsiella spp. (7%). Phenotypic resistance to amoxicillin-clavulanic acid, aztreonam, cefuroxime, cefixime, cefepime, imipenem, meropenem, gentamicin, netilmicin, and amikacin was 50.4%, 65.6%, 66.8%, 80.5%, 54.4%, 41.6%, 25.7%, 41.2%, 37.2%, and 42.9%, respectively.  Total 142 UTI pathogens were obtained from 150 urine samples, with Klebsiella spp. (39%) and Escherichia coli (24%) are the major pathogens. Phenotypic resistance to amoxycillin-clavulanic acid, aztreonam, cefuroxime, cefixime, cefepime, imipenem, meropenem, gentamicin, netilmicin, and amikacin was 93.7%, 75.0%, 91.5%, 93.7%, 88.0%, 72.5%, 13.6%, 44.4%, 71.1%, and 43%, respectively.  Twenty four diarrheal isolates carried either blaNDM-1 or blaVIM genes; the overall MBL gene prevalence was 10.5%. Thirty six UTI pathogens carried either blaNDM-1 or blaVIM genes (25.4%). Seven isolates carried both blaNDM-1 and blaVIM genes.  MBL genes exhibited a strong association with phenotypic carbapenem and other beta-lactam antibiotic resistance. Resistance to carbapenems requires active surveillance and stewardship.

Museums are called to respond to contemporary challenges and contribute to the formation of more progressive societies. One of the major challenges of our time is climate change and museums could construct cocreated narratives around climate and implement targeted actions for the audiences through their sensorial and affective experiences. More specifically, Geology and Palaeontology museums are repositories of knowledge on geoheritage and geoconservation, recognized for their scientific, pedagogical, cultural and recreational values. The educational potential of geological and paleontological exhibits could be used in informal education activities regarding the climate emergency. Taking the above into consideration, this study focuses on both the creation and evaluation of an educational program for the Natural History Museum of Arsakeio Campus at Psychicko.

This study uses machine learning to identify key factors influencing the cost-effectiveness of over-the-counter (OTC) medications. By developing a novel cost-effectiveness rating (CER) from user ratings and prices, we analyzed data from Amazon. The findings indicate that FSA/HSA eligibility, symptom treatment range, safety warnings, special effects, active ingredients, and packaging size significantly impact cost-effectiveness across cold, allergy, digestion, and pain relief medications. Medications eligible for FSA or HSA funds, treating a broader range of symptoms, and having smaller packaging are perceived as more cost-effective. Cold medicines with safety warnings were found to be cost-effective due to their lower average price and effective ingredients like phenylephrine and acetaminophen. Allergy medications with kid-friendly features showed higher cost-effectiveness, and ingredients like calcium, famotidine, and magnesium boosted the cost-effectiveness of digestion medicines. These insights help consumers make informed purchasing decisions and assist manufacturers and retailers in enhancing product competitiveness. Overall, this research supports better decision-making in the pharmaceutical industry by highlighting factors that drive cost-effective medication purchases.

Stroke constitutes a significant public health concern due to its impact on mortality and morbidity. This study investigates the utility of machine learning algorithms in predicting stroke and identifying key risk factors using data from the Suita study, comprising 7,389 participants and 53 variables. Initially, unsupervised K-prototype clustering categorized participants into risk clusters, while five supervised models including Logistic Regression (LR), Random Forest (RF), Support Vector Machine (SVM), eXtreme Gradient Boosting (XGBoost), and Light Gradient Boosted Machine (Light-GBM) were employed to predict stroke outcomes. Stroke incidence disparities among identified risk clusters using the unsupervised K-prototype clustering method are substantial, according to the findings. Supervised learning, particularly RF was a preferable option because of the higher levels of performance metrics. The Shapley Additive Explanations (SHAP) method identified age, systolic blood pressure, hypertension, estimated glomerular filtration rate, metabolic syndrome, and blood glucose level as key predictors of stroke, aligning with findings from the unsupervised clustering approach in high-risk groups. Additionally, previously unidentified risk factors such as elbow joint thickness, fructosamine, hemoglobin, and calcium level demonstrate potential for stroke prediction. In conclusion, machine learning facilitated accurate stroke risk predictions and highlighted potential biomarkers, offering a data-driven framework for risk assessment and biomarker discovery.

The increasing prevalence of species that are detrimental to biodiversity is a major concern, particularly for managers of National Parks. To develop effective programs for controlling weeds, it is essential to have a thorough understanding of the extent and severity of infestations, as well as the contributing factors such as temperature, rainfall, and disturbance. Predicting these factors on a regional scale requires models that can incorporate a wide range of variables in a quantifiable manner, while also assisting with on-ground operations. In this study, we present two Bayesian Network models specifically designed for six significant weed species found along the southern coast of Australia. Our models are based on empirical data collected during a coastal weed survey conducted in 2015 and repeated in 2016. We applied these models to the coastal national parks in the isolated and pristine East Gippsland region. Importantly, the prediction models were developed at two different spatial scales that directly corresponded to the scale of the observations. Our findings indicate that coastal habitats, with their vulnerable environments and prevalence of open dune systems, are particularly susceptible to weed infestations. Moreover, adjacent regions also have the potential for colonization if these infestations are not effectively controlled. Climate-related factors play a role in moderating the potential for colonization, which is a significant concern for weed control efforts in the context of global climate change.

We propose a novel adaptive importance sampling scheme for Bayesian inversion problems where the inference of the variables of interest and the power of the data noise is split. More specifically, we consider a Bayesian analysis for the variables of interest (i.e., the parameters of the model to invert), whereas we employ a maximum likelihood approach for the estimation of the noise power. The whole technique is implemented by means of an iterative procedure, alternating sampling and optimization steps. Moreover, the noise power is also used as a tempered parameter for the posterior distribution of the the variables of interest. Therefore, a sequence of tempered posterior densities is generated, where the tempered parameter is automatically selected according to the actual estimation of the noise power. A complete Bayesian study over the model parameters and the scale parameter can be also performed. Numerical experiments show the benefits of the proposed approach.

This paper considers estimating the ratio of two distributions with different parameters and common supports. We consider a Bayesian approach based on the Log--Huber loss function which is resistant to outliers and useful to find robust M-estimators. We propose two different types of Bayesian density ratio estimators and compare their performance in terms of Bayesian risk function with themselves as well as the usual plug-in density ratio estimators. Some applications such as classification and divergence function estimation are addressed.

Technology development changes society and society demands new and innovative technology development. We analyze technology to understand society and technology itself. Many researches have been introduced in various fields. Most of them were about patent analysis. This is because detailed and accurate results of research and development are patented. In this paper, we study on new patent analysis method based on count data model and Bayesian regression analysis. Using count data model, we analyze the technological keywords extracted from the collected patent documents. We use the posterior distribution of Bayesian statistics to reflect the experience and knowledge of the relevant technological experts in the analysis model. Moreover, we apply the proposed model to finding sustainable technologies. Finding and developing sustainable technologies is an important activity for companies and research institutes to maintain their technological competitiveness. To illustrate how our modeling could be applied to real domain, we carry out a case study using the patent documents related to artificial intelligence.

This paper formulates the classic Monty Hall problem as a Bayesian game. Allowing Monty a small amount of freedom in his decisions facilitates a variety of solutions. The solution concept used is the Bayes Nash Equilibrium (BNE), and the set of BNE relies on Monty's motives and incentives. We endow Monty and the contestant with common prior probabilities (p) about the motives of Monty, and show that under certain conditions on p, the unique equilibrium is one where the contestant is indifferent between switching and not switching. This coincides and agrees with the typical responses and explanations by experimental subjects. Finally, we show that our formulation can explain the experimental results in Page (1998) [12]; that more people gradually choose switch as the number of doors in the problem increases.

Categorical variables are common in spatial data analysis. Traditional analytical methods for deriving probabilities of class occurrence, such as kriging-family algorithms, have been hindered by the discrete characteristics of categorical fields. This study introduces the theoretical backgrounds of linear Bayesian updating (LBU) approach for spatial classification through expert system. Transition probabilities are interpreted as expert opinions for updating the prior marginal probabilities of categorical response variables. The main objective of this paper is to present the solid theoretical foundations of LBU and provide a categorical random field prediction method which yields relatively higher classification accuracy compared with conventional Markov chain random field (MCRF) approach. A real-world case study has also been carried out to demonstrate the superiority of our method. Since the LBU idea is originated from aggregating expert opinions and not restricted to conditional independent assumption (CIA), it may prove to be reasonably adequate for analyzing complex geospatial data sets, like remote sensing images or area-class maps.

Heart failure is a prevalent cardiovascular condition with significant health implications, necessitating effective diagnostic strategies for timely intervention. This study explores the potential of continuous monitoring of non-invasive signals, specifically integrating Photoplethysmogram (PPG) and Electrocardiogram (ECG), for enhancing early detection and diagnosis of heart failure. Leveraging a dataset from the MIMIC-III database, encompassing 682 heart failure patients and 954 controls. Feature selection techniques were used to systematically select key features which were identified for their clinical relevance and significance in capturing cardiovascular dynamics and to reduce computational complexity and to decrease the chance of overfitting the ML algorithms. These features are then utilized to train and evaluate machine learning algorithms, resulting in a model with an impressive accuracy of 98%, sensitivity of 97.60%, specificity of 96.90%, and precision of 97.20%. The integrated approach outperforms single-signal strategies, showcas-ng its potential for early, precise, and non-invasive heart failure diagnosis. Furthermore, the study underscores the significance of continuous monitoring through wearables, emphasizing the benefits of integrating multiple signals for a comprehensive evaluation of cardiovascular health. The proposed approach holds promise for implementation in hardware systems to enable continuous monitoring, aiding in early detection and prevention of critical health conditions.

P versus NP is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? A precise statement of the P versus NP problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed. Another major complexity class is coNP. Whether NP = coNP is another fundamental question that it is as important as it is unresolved. In 1979, Fortune showed that if any sparse language is coNP-complete, then P = NP. We prove there is a possible sparse language in coNP-complete. In this way, we demonstrate the complexity class P is equal to NP.

Deep Learning is developing interesting tools which are of great interest for inverse imaging applications. In this work, we consider a medical imaging reconstruction task from subsampled measurements, which is an active research field where Convolutional Neural Networks have already revealed their great potential. However, the commonly used architectures are very deep and, hence, prone to overfitting and unfeasible for clinical usages. Inspired by the ideas of the green-AI literature, we here propose a shallow neural network to perform an efficient Learned Post-Processing on images roughly reconstructed by the filtered backprojection algorithm. The results obtained on images from the training set and on unseen images, using both the non-expensive network and the widely used very deep ResUNet show that the proposed network computes images of comparable or higher quality in about one fourth of time.

Increased data acquisition by uncalibrated, heterogeneous digital sensor systems such as smartphones present new challenges. Binary metrics are proposed for the quantification of cyber-physical signal characteristics and features, and a standardized constant-Q variation of the Gabor atom is developed for use with wavelet transforms. Two different continuous wavelet transform (CWT) reconstruction formulas are presented and tested under different signal to noise ratio (SNR) conditions. A sparse superposition of Nth order Gabor atoms worked well against a synthetic blast transient using the wavelet entropy and an entropy-like parametrization of the SNR as the CWT coefficient-weighting functions. The proposed methods should be well suited for sparse feature extraction and dictionary-based machine learning across multiple sensor modalities.

Driven by the importance of early detection for improving patient outcomes, this study investigates the effectiveness of various machine learning algorithms in predicting lung cancer based on clinical data. Lung cancer remains a significant global health concern, and this research seeks to contribute to advancements in early diagnosis through the application of machine learning techniques. The dataset consists of 385 training and 97 test samples, with a k-fold cross-validation approach (k=5) utilized to mitigate overfitting. Additionally, the ADASYN oversampling technique is employed to address class imbalance. Our analysis includes traditional algorithms such as Logistic Regression and Decision Trees, as well as ensemble methods like XGBoost, LGBM, and AdaBoost. Furthermore, we explore the effectiveness of deep learning models, particularly Deep Neural Networks (DNN). Results demonstrate promising accuracy rates across all models, with some outperforming others in terms of precision, recall, and F1-score. Our findings reveal that LGBM achieves the highest accuracy among all models, with an accuracy rate of 96.91%. It also exhibits superior performance in terms of precision, recall, and F1-score, particularly in classifying both positive and negative instances of lung cancer.

As Artificial Intelligence (AI) technology, particularly Machine Learning algorithms, becomes increasingly ubiquitous, our abilities to understand and interpret AI and machine learning algorithms are becoming increasingly desirable. Visualization has been used as a common tool to view and understand complex machine learning processes. In this paper, we will focus on developing a general framework for the visualization of machine learning models as a scalar valued multi-dimensional function to help users understand how the models behave over different viewing spaces. We first give a formal definition of the visualization problem. Interpolation-based morphing and subspace sampling techniques are applied to generate various renderings through projections and cross-sections of the model space as 3D surfaces or heatmap images. This method will be applied to two real-world datasets and applications: the diagnosis of Alzheimer's Disease (AD) using a human brain networks dataset and a real-world benchmark dataset for predicting home credit default risks. The visualizations show that different machine learning algorithms can behave quite differently under different conditions.

In the intersection of the Internet of Things (IoT) and Machine Learning (ML), the choice between high-level and low-level programming libraries presents a significant dilemma for developers, impacting not only the efficiency and effectiveness of ML models but also their environmental footprint. We have proposed a comprehensive framework to aid in this decision-making process, underpinned by a detailed comparative analysis of both types of libraries on one of the key IoT ML task; image classification. We have introduced a novel algorithm designed to calculate the green footprint of ML model training, factoring in execution time, memory utilization, power consumption, and CPU temperature, addressing the urgent need for sustainable ML practices. Through an empirical evaluation of popular libraries such as PyTorch for high-level and Libtorch for low-level development, we have assessed their performance, development efficiency, and hardware compatibility. The culmination of our research is a decision support system that synthesizes the experimental findings to guide developers toward choices that harmonize model performance with environmental sustainability.

In emergency situations, ensuring standardized Cardiopulmonary Resuscitation (CPR) actions is crucial. However, current Automated External Defibrillators (AEDs) lack methods to determine whether CPR actions are performed correctly, leading to inconsistent CPR quality. To address this issue, we introduce a novel method called Deep Learning-based CPR Action Standardization (DLCAS). This method involves three parts. First, it detects correct posture using OpenPose to recognize skeletal points. Second, it identifies a marker wristband with our CPR-Detection algorithm and measures compression depth, count and frequency using a depth algorithm. Finally, we optimize the algorithm for edge devices to enhance real-time processing speed. Extensive experiments on our custom dataset have shown that the CPR-Detection algorithm achieves a mAP0.5 of 97.04%, while reducing parameters to 0.20M and FLOPs to 132.15K. In a complete CPR operation procedure, the depth measurement solution achieves an accuracy of 90% with a margin of error less than 1 cm, while the count and frequency measurements achieve 98% accuracy with a margin of error less than 2 counts. Our method meets the real-time requirements in medical scenarios, and the processing speed on edge devices have increased from 8fps to 25fps.

Rice has become the second major food among rural people. It is one of the most nutrient and low-cost food available in Asia. Rice is composed of two major subspecies as Japonica and Indica and it belongs to the Poaceae family. The World Bank predicts that rice demand will grow 51% faster than population growth in 2025. It is high time to develop a model which predicts the type of infected paddy leaf and avoids the loss of grains. In this paper, the proposed hybrid CNN model, three CNN networks with different layer properties are trained parallel. The extracted feature from these CNN networks is combined to provide the classification of the type of infected leaf. Fieldwork was carried and about 340 samples are collected from five different types of classes. The proposed hybrid model was tested with both the fieldwork dataset and also with an available dataset on the internet. The experimental results show that the proposed model outperforms the other CNN network and yields an accuracy value of 98%, a precision value of 95%, and a misclassification rate of 4% respectively.

Deep learning methods paired with sidescan sonar (SSS) are commonly used in underwater search and rescue operations for drowning victims, wrecks, and airplanes. However, these techniques are primarily designed to detect mine-like objects and are rarely applied to identifying features in dynamic dredge pit environments, due to a lack of datasets. In this study, we present a Sandy Point Dredge Pit (SPDP) dataset, in which high-resolution SSS data were collected from the west flank of Mississippi bird foot delta of the Louisiana inner shelf. This dataset contains a total of 385 SSS images. We introduce an Effective Geomorphology Classification model (EGC). By ablation studies, we analyze the utility of transfer learning on different model architectures and the impact of data augmentations on model performance. This EGC model will make geomorphic features identification in dredge pit environments quick and efficient which requires extensive experience and professional knowledge. The combination of SSS images and EGC model is a cost-effective and valuable toolkit for hazards monitoring in marine dredge pit environment. The SPDP SSS images dataset, especially the feature of pit wall without rotational slump, is also valuable for other machine learning modelers.

Accurate traffic simulation models play a crucial role in developing intelligent transport systems that offer timely traffic information to users and efficient traffic management. However, calibrating these models to represent real-world traffic conditions accurately poses a significant challenge due to the dynamic nature of traffic flow and the limitations of traditional calibration methods. This article introduces a machine learning-based approach to calibrate macroscopic traffic simulation models using real-time traffic video stream data. By leveraging computer vision technologies to extract key traffic parameters from video streams, the approach demonstrated a notable improvement in aligning the generated data from the calibrated simulation model with car sensor data, achieving an average improvement of over 50% compared to the uncalibrated macroscopic model. Moreover, there was a substantial reduction in data drift for the machine learning model integrated into the virtual transport space using vehicle-to-everything technology, resulting in a more than fourfold decrease in the average absolute error of the model.

Classifying network flow subsequences in an Industrial IoT gateway is an effective method for identifying Industrial IoT faults. This paper proposes a subsequence classification algorithm SSGBUL-IKNN based on unsupervised learning encoding to address the problem of low classification accuracy. Firstly, we built a network module based on unsupervised learning to encode the flow sequence of the Industrial IoT gateway. In the encoding module, a subsequence calibration algorithm controls the increasing error during the coding process. Then, the specific fault type is obtained through an improved KNN classification algorithm based on the indication distance source from the integrated coding sequences converted by multi-dimensional network flow sequences. The test result on three Industrial IoT datasets of a sewage treatment plant shows that the accuracy of SSGBUL-IKNN in this paper exceeds 92%, significantly higher than the algorithm DTW and TSF. It reaches the classification requirements of Industrial IoT fault diagnosis.

In recent years, advancements in brain science and neuroscience have significantly influenced the field of computer science, particularly in the domain of reinforcement learning (RL). Drawing insights from neurobiology and neuropsychology, researchers have leveraged these findings to develop novel mechanisms for understanding intelligent decision-making processes in the brain. Concurrently, the emergence of quantum computing has opened new frontiers in artificial intelligence, leading to the development of quantum machine learning (QML). This study introduces a novel model that integrates Quantum Spiking Neural Networks (QSNN) and Quantum Long Short-Term Memory (QLSTM) architectures, inspired by the complex workings of the human brain. Specifically designed for reinforcement learning tasks in energy-efficient environments, our approach progresses through two distinct stages mirroring sensory and memory systems. In the initial stage, analogous to the brain’s hypothalamus, low-level information is extracted to emulate sensory data processing patterns. Subsequently, resembling the hippocampus, this information is processed at a higher level, capturing and memorizing correlated patterns. We conduct a comparative analysis of our model against existing quantum models such as Quantum Neural Networks and their classical counterparts, elucidating its unique contributions. Through empirical results, we aim to underscore the effectiveness of our approach in optimizing energy consumption in practical scenarios.

In this paper, under the symmetric entropy and the scale squared error loss functions, we consider the maximum likelihood (ML) estimation and Bayesian estimation of the Shannon entropy and Rényi entropy of the two-parameter inverse Weibull distribution. In the ML estimation, the dichotomy is used to solve likelihood equation. In addition, the approximation confidence interval is given by the Delta method. Because the form of estimation results is more complex in the Bayesian estimation, the Lindley approximation method is used to achieve the numerical calculation. Finally, Monte Carlo simulations and a real data set are used to illustrate the results derived. By comparing the mean square error between the estimated value and the real value, it can be found that the performance of ML estimation of Shannon entropy is better than that of Bayesian estimation, and there is no significant difference between the performance of ML estimation of Rényi entropy and that of Bayesian estimation.

Bayesian nonlinear mixed effects models for data in the form of continuous, repeated measurements from a population, also known as Bayesian hierarchical nonlinear models, are a popular platform for analysis when interest focuses on individual specific characteristics and relevant uncertainty quantification. Due to the limitation of computational power, this framework was relatively dormant until the late 1980s, but in recent years, the statistical research community saw vigorous development of new methodological and computational techniques for these models, the emergence of software, and wide application of the models in numerous industrial and academic fields. This article presents an overview of the formulation, interpretation, and implementation of Bayesian nonlinear mixed effects models and surveys recent advances and applications.

Pedestrian trajectories are crucial for self-driving cars to plan their paths effectively. The sensors implanted in these self-driving vehicles, despite being state-of-the-art ones, often face inaccuracies in the perception of surrounding environments due to technical challenges for adverse weather conditions, interference from other vehicles sensors and electronic devices, and signal reception failure, leading to incompleteness in trajectory data. But for real-time decision making for autonomous driving, the trajectory imputation is no less crucial. Previous attempts to address this issue such as statistical inference and machine learning approaches have shown promise. Yet, the landscape of deep learning is rapidly evolving with new and more robust models emerging. In this research, we have proposed an encoder-decoder architecture, Human Trajectory Imputation Model, coined as HTIM, to tackle these challenges. This architecture aims to fill in the missing parts of pedestrian trajectories. The model has been evaluated using the Intersection drone inD dataset, containing trajectory data at suitable altitudes preserving naturalistic pedestrian behavior with varied dataset sizes. To assess the effectiveness of our model, we have utilized L1, MSE, Quantile and ADE loss. Our experiments have demonstrated that HTIM outperforms the majority of the state-of-the-art methods in this field, thus indicating its superior performance in imputing pedestrian trajectories.

Ridge regression is one of the most popular shrinkage estimation methods for linear models. Ridge regression effectively estimates regression coefficients in the presence of high-dimensional regressors. Recently, a generalized ridge estimator was suggested by generalizing the uniform shrinkage of ridge regression to the non-uniform shrinkage, which was shown to perform well under sparse and high-dimensional linear models. In this paper, we introduce our newly developed R package “g.ridge” (the first version published on 2023-12-07 at https://cran.r-project.org/package=g.ridge) that implements both the ridge estimator and generalized ridge estimators. The package equips with the generalized cross-validation for automatic estimation of shrinkage parameters. The package also includes a convenient tool for generating a design matrix. By simulations, we test the performance of the R package under sparse and high-dimensional settings with the normal and skew-normal error distributions. From the simulation results, we conclude that the generalized ridge estimator is superior to the benchmark ridge estimator based on “glmnet”, and hence, it can be the most recommended estimator under sparse and high-dimensional models. We demonstrate the package using the intracerebral hemorrhage data.

Sparse recovery of fluid flows using data-driven proper orthogonal decomposition (POD) basis is systematically explored in this work. Fluid flows are manifestations of nonlinear multiscale PDE dynamical systems with inherent scale separation that impact the system dimensionality. Given that sparse reconstruction is inherently an ill-posed problem, the most successful approaches require the knowledge of the underlying basis space spanning the manifold in which the system resides. In this study, we employ an approach that learns basis from singular value decomposition (SVD) of training data to reconstruct sparsely sensed information. This results in a set of four control parameters for sparse recovery, namely, the choice of basis, system dimension required for sufficiently accurate reconstruction, sensor budget and their placement. The choice of control parameters implicitly determines the choice of algorithm as either $l_2$ minimization reconstruction or sparsity promoting $l_1$ norm minimization reconstruction. In this work, we systematically explore the implications of these control parameters on reconstruction accuracy so that practical recommendations can be identified. We observe that greedy-smart sensor placement provides the best balance of computational complexity and robust reconstruction for marginally oversampled cases which happens to be the most challenging regime in the explored parameter design space.

Breast cancer stands as a predominant health concern for women globally. As mammography is the primary screening tool for breast cancer detection, improving the detection of breast cancer at screening could save more lives. This mammography re-view paper provides a systematic review of computer-aided techniques during a specific time frame for the segmentation and classification of microcalcification, evaluating image processing, machine learning, and deep learning techniques. The systematic review is meticulously carried out, adhering closely to the preferred reporting items for Systematic Reviews and Meta-Analysis (PRISMA) guidelines. This article focuses on mammographic breast cancer detection approaches based on automated systems, discussed chronologically from 1970 through 2023. This article encompasses the breadth of artificial intelligence-based methods from the most primitive to the most sophisticated models. Image processing and machine learning-based methods are compre-hensively reviewed. The evaluation of a deep learning architecture based on self-extracted features for classification tasks demonstrated outclass performance. Large-scale datasets required for a broader and in-depth analysis of novel methods for breast cancer detection are also discussed in this article. This research work is aligned with the United Nations' sustainability de-velopment goals.

The modern supply chain (SC) is growing in terms of data, devices, users, and stakeholders, which introduced new security challenges and threats, especially with the reliance on centralized servers or cloud platforms. In addition, increased trust among system participants exposes the SC to a higher risk of vulnerabilities which require strong security measures. This article proposes a hybrid security framework for SC systems, BC-DRLzSC, that integrates Blockchain (BC) and Deep Reinforcement Learning (DRL) designed to operate in a zero trust (ZT) environment. In particular, we propose a decentralized BC-based approach integrated with smart contracts to manage system participant registration and authentication and to control access to system resources. BC-DRLzSC adopts a ZT architecture to reinforce SC security, which can be achieved with an advocate to verify each entity’s trustworthiness before granting or retaining access to system resources. Incorporating the ZT architecture, with BC and DRL, can potentially and significantly bolster SC system security. DRL is employed to develop a proactive attack detection model that continuously monitors the incoming traffic from authenticated nodes within the network and predicts any malicious actions. Finally, we evaluate the performance of our proposed DRL solution using the NSL-KDD dataset.

The numerical implementation of the controllers allows the use of very complex algorithms with ease. However, in practice, due to its proven advantages, the PID controller (and its variants) is widely used in industrial control systems as well as in many other applications that require continuous control. Most of the methods for tuning the parameters of PID controllers are based on time-invariant linear models of the processes, which in practice can lead to poor performance of the control system. The paper presents an application of reinforcement learning algorithms in tuning of PID controllers for the control of some classes of continuous nonlinear systems. Tuning the parameters of PID controllers is done with the help of Twin Delayed Deep Deterministic Policy Gradients (TD3) algorithm which presents a series of advantages compared to other similar methods from Machine Learning dedicated to continuous state and action spaces. TD3 algorithm is an off-policy Actor-Critic based method and was used as it does not require a system model. The presented technique is applied for control of a biotechnological system which has a strongly nonlinear dynamic. The proposed tuning method is compared to the classical tuning methods of PID controllers. The performance of the tuning method based on the TD3 algorithm is demonstrated through simulation illustrating the effectiveness of the proposed methodology.

This study examines the causal relationships between interest rates in the Korean financial market using a vector error correction model (VECM) and a Bayesian network. The Bayesian network, a novel approach in this context, identifies two distinct transmission channels: one led by call rates (reflecting monetary policy) and another by 10-year Treasury bond yields (reflecting fiscal policy). While the call rate channel aligns with traditional views, affecting bank lending rates, corporate bond spreads, and commercial paper rates, the 10-year Treasury yield channel highlights a separate fiscal policy transmission mechanism, influencing commercial paper rates indirectly through 30-year Treasury yields and directly impacting merchant bank lending rates. This finding suggests that fiscal intervention could potentially interfere with monetary policy, emphasizing the need for coordinated macroeconomic policy measures. The study also emphasizes the role of 10-year Treasury bonds as a benchmark in the Korean bond market, reflecting medium- to long-term economic outlooks and serving as the underlying asset for various derivatives.

Oral squamous cell carcinoma often arises from an oral potentially malignant disorder called oral leukoplakia (OL). With this work we aimed to develop a novel data-driven predictive model based on gene expression profiles to distinguish OL patients who underwent malignant transformation from those who did not. We used the Tree Augmented Naïve (TAN) Bayes classifier to predict the posterior probability of having oral cancer given the data. 86 patients were included with a median follow-up of 7.11 years. Fifty-one patients (51/86; 59%) underwent malignant transformation. We found that 16 genes were predictors of oral cancer in patients with OL and these included SLC7A11, SPINK6, SERPINA12, VIT, ATP1B3, CST6, FLRT2, ELMOD1, AZGP1, RNASE13, DIO2, ECM1, CYP4F11, SYTL4, AKR1C1, and AKR1C3. In conclusion, we showed that Bayesian gene networks are a data-driven approach which could be used also in other predictor models in oncology.

Lysine is the first limiting essential amino acid in rice because it is present in the lowest quantity compared to all the other amino acids. Amino acids are the building block of proteins and play an essential role in maintaining the human body’s healthy functioning. Rice is a staple food for large proportion of the global population, thus increasing the lysine content in rice will improve its nutritional value. In this paper, we studied the lysine biosynthesis pathway in rice (Oryza Sativa) to identify the regulators of the lysine reporter gene LYSA (LOC_Os02g24354). Genetically intervening at the regulators has the potential to increase the overall lysine content in rice. We modeled the lysine biosynthesis pathway in rice seedlings under normal and saline (NaCl) stress conditions using Bayesian networks. We estimated the model parameters using experimental data and identified the gene DAPF(LOC_Os12g37960) as a positive regulator of the lysine reporter gene LYSA under both normal and saline stress conditions. Based on this analysis, we conclude that the gene DAPF is a potent candidate for genetic intervention. Upregulating DAPF using methods such as CRISPR-Cas9 has the potential to upregulate the lysine reporter gene LYSA and increase the overall lysine content in rice.