Tail-biting convolutional codes extend the classical zero-termination convolutional codes: Both encoding schemes force the equality of start and end states, but under the tail-biting each state is a valid termination. This paper proposes a machine-learning approach to improve the state-of-the-art decoding of tail-biting codes, focusing on the widely employed short length regime as in the LTE standard. This standard also includes a CRC code. First, we parameterize the circular Viterbi algorithm, a baseline decoder that exploits the circular nature of the underlying trellis. An ensemble combines multiple such weighted decoders, each decoder specializes in decoding words from a specific region of the channel words' distribution. A region corresponds to a subset of termination states; the ensemble covers the entire states space. A non-learnable gating satisfies two goals: it filters easily decoded words and mitigates the overhead of executing multiple weighted decoders. The CRC criterion is employed to choose only a subset of experts for decoding purpose. Our method achieves FER improvement of up to 0.75dB over the CVA in the waterfall region for multiple code lengths, adding negligible computational complexity compared to the circular Viterbi algorithm in high SNRs.

Although automated Acute Lymphoblastic Leukemia (ALL) detection is essential, it is challenging due to the morphological correlation between malignant and normal cells. The traditional ALL classification strategy is arduous, time-consuming, often suffers inter-observer variations, and necessitates experienced pathologists. This article has automated the ALL detection task, employing deep Convolutional Neural Networks (CNNs). We explore the weighted ensemble of deep CNNs to recommend a better ALL cell classifier. The weights are estimated from ensemble candidates' corresponding metrics, such as accuracy, F1-score, AUC, and kappa values. Various data augmentations and pre-processing are incorporated for achieving a better generalization of the network. We train and evaluate the proposed model utilizing the publicly available C-NMC-2019 ALL dataset. Our proposed weighted ensemble model has outputted a weighted F1-score of 88.6%, a balanced accuracy of 86.2%, and an AUC of 0.941 in the preliminary test set. The qualitative results displaying the gradient class activation maps confirm that the introduced model has a concentrated learned region. In contrast, the ensemble candidate models, such as Xception, VGG-16, DenseNet-121, MobileNet, and InceptionResNet-V2, separately produce coarse and scatter learned areas for most example cases. Since the proposed ensemble yields a better result for the aimed task, it can experiment in other domains of medical diagnostic applications.

The main objective of this work was to evaluate the application of individual and ensemble machine learning models to classify malignant and benign breast masses using features from two-dimensional (2D) correlated spectroscopy spectra extracted from five-dimensional Echo Planar-Correlated Spectroscopic Imaging (5D EP-COSI) and Diffusion-weighted imaging (DWI). Twenty-four different metabolite and lipid ratios with respect to 2D diagonal peaks at 1.4ppm and 5.4ppm, and water from one-dimensional non-water-suppressed (NWS) spectra were used as the features. Additionally, water fraction, fat fraction and water-to-fat ratios from NWS spectra and apparent diffusion coefficients (ADC) from DWI were included. Nine most important features were identified using recursive feature elimination. XGBoost (AUC:93.0%, Accuracy:85.7%, F1-score:87.6%), GradientBoost (AUC:94.4%, Accuracy:87.0%, F1-score:89.4%), CatBoost (AUC:95.2%, Accuracy:86.9%, F1-score:88.4%) and RandomForest (AUC:92.2%, Accuracy:85.3%, F1-score:87.6%) were the best performing models. While the conventional biomarkers like choline, myo-Inositol, and glycine were statistically significant predictors, the key features contributing to the classification were ADC, 2D diagonal peaks at 0.9ppm, 2.1ppm and 2.3ppm, cross peaks between 1.4 and 0.9ppm, 4.3 and 4.1ppm, 2.1 and 1.4ppm and the triglyceryl-fat cross peak. The results highlight the contribution of the 2D spectral peaks to the model, and they demonstrate the potential of 5D EP-COSI for early breast cancer detection.

Due to the highly nonlinear, multi-stage, and strongly time-varying marine lysozyme fermentation process, it is difficult to assure the stability and prediction accuracy of the traditional single global soft sensor model on a global scale. This study innovatively proposed a soft sensor model based on an improved seagull optimization algorithm (ISOA) combined with Gaussian process regression (GPR) weighted ensemble learning. First, the sample data set is divided into multiple local sample subsets by the improved density peak clustering algorithm (ADPC). Second, the Gaussian process regression model is optimally altered with an improved seagull optimization algorithm for the purpose of establishing the corresponding sub-prediction model. Finally, the prediction model's fusion strategy is ultimately determined depending on the degree of connection between the test samples and a subset of local pieces. Simulation results show that the proposed soft sensor model, which searches GPR based on ISOA and combines various sub-models, can predict the key biochemical parameters of the marine lysozyme fermentation process better with less prediction error under the condition of fewer training data, and it can be expanded to the soft sensor models of general nonlinear systems, according to simulation results.

Feature selection is a crucial step in machine learning, aiming to identify the most relevant features in high-dimensional data, in order to reduce the computational complexity of model development and improve its generalization performance. Ensemble feature ranking methods combine the results of several feature selection techniques to identify a subset of the most relevant features for a given task. In many cases, they produce a more comprehensive ranking of features than the individual methods used in them. This paper presents a novel approach to ensemble feature ranking, which uses a weighted average of the individual ranking scores calculated by the individual methods. The optimal weights are determined using a Taguchi-type design of experiments. The proposed methodology significantly improves classification performance on the CSE-CIC-IDS2018 dataset, particularly for attack types where traditional average-based feature ranking score combinations resulted in low classification metrics.

Background and Objectives To compare navigator-gated three-dimensional T1-weighted gradient-echo sequences (NG-3D T1W-GRE) with standard breath-hold T1W-GRE (BH T1W-GRE) for the detection of HCC nodules in patients with chronic viral hepatitis which undergo at magnetic resonance imaging (MRI) using gadoxetic acid. Methods and materials We evaluated 58 patients with hepatic nodules at least 1 cm in diameter detected by ultrasound who underwent liver MRI including NG-3D T1W-GRE sequences and breath hold T1-weighted gradient-echo sequences with different flip angles(FA) at 10-25-40° after contrast administration of gadoxetic acid at magnetic scanner operating at1.5 Tesla. Image quality and relative hepatic and nodular enhancement were evaluated by three blinded reviewers. Results In these patients, image quality of NG-3D T1W-GRE was assessed significantly better than quality of BHT1W- GRE (P < 0.005) and relative enhancement was significantly higher than that of BH- T1W-GRE ( P

In this paper, we introduce the notion of the generalized $w$-group inverse in a Banach algebra with proper involution. This is a natural generalization of generalized (weak) group inverse in Banach *-algebras. Many elementary properties of such new weighted generalized inverse are presented. We further establish the equivalent relations between generalized weighted group inverse and weighted generalized Drazin inverse. Related properties of generalized (weak) group inverse are extended to the wider cases.

We study L_2-approximation problems in the weighted Hilbert spaces in the worst case setting. Three interesting weighted Hilbert spaces appear in this paper, whose weights are equipped with two positive parameters $\ga_j$ and $\az_j$ for $j=1,\,2,\dots,\,d$. We consider the worst case error of algorithms that use finitely many arbitrary continuous linear functionals. We discuss the exponential convergence-(t,s)-weak tractability (EC-(t,s)-WT) of these L_2-approximation problems under the absolute or normalized error criterion. In particular, we obtain the sufficient and necessary conditions for EC-(1,1)-WT and EC-(t,1)-WT with t

Day-ahead forecasting of electricity prices is important in deregulated electricity markets for all the stakeholders: energy wholesalers, traders, retailers, and consumers. Electricity price forecasting is an inherently difficult problem due to its special characteristic of dynamicity and non-stationarity. In this paper, we present a robust price forecasting mechanism that shows resilience towards aggregate demand response effect and provides highly accurate forecasted electricity prices to the stakeholders in a dynamic environment. We employ an ensemble prediction model in which a group of different algorithms participate in predicting the price for each hour of a day. We propose two different strategies, namely, Fixed Weight Method (FWM) and Varying Weight Method (VWM), for selecting each hour's expert algorithm from the set of participating algorithms. In addition, we utilize a carefully engineered set of features selected from a pool of features derived from information such as past electricity price data, weather data, and calendar data. The proposed ensemble model offers better results than both the Pattern Sequence-based Forecasting (PSF) method and our own previous work using Artificial Neural Networks (ANN) alone do on the datasets for New York, Australian, and Spanish electricity markets.

Various means (the arithmetic mean, the geometric mean, the harmonic mean, the power means) are often used as central tendency statistics. A new statistic of such type is offered for a sample from a distribution on the positive semi-axis, the gamma-weighted geometric mean. This statistic is a certain weighted geometric mean with adaptive weights.

Based on the perspective of complex directed weighted network analysis, this paper constructs a static resilience evaluation framework for trade networks from two dimensions: structural resilience and node resilience. It studies the evolution of static resilience in the upstream, midstream, downstream, and recycling trade networks of global wood forest products from 2002 to 2021. The study finds that the total trade volume of global wood forest products has increased by 58.0%, 77.3%, 71.2%, and 77.2% in the upstream, midstream, downstream, and recycling sectors, respectively. The downstream trade network exhibits efficient information transmission and resource mobility capabilities. All four types of trade networks exhibit scale-free characteristics, with core countries such as China, the United States, and Germany playing a dominant role in the network and playing a crucial role in network robustness, but also increasing network vulnerability. In terms of unweighted assortativity, all four networks exhibit the characteristic of "small countries relying on hubs," while the weighted assortativity of the downstream network is positive, indicating enhanced network resilience. In terms of node resilience, countries exhibit significant differences and dynamic changes. China demonstrates strong resilience and adaptability, while the United States maintains its core position. China's influence in the downstream network has significantly increased, and India has rapidly emerged in the recycling network. To enhance network resilience, it is necessary to increase diversity and redundancy, establish effective emergency response mechanisms, and promote the diversification and green transformation of the supply chain.

This paper explores how smart cities can cope with land subsidence and liquefaction in the context of rapid urbanization in Japan. Since the 1960s, liquefaction has become an important topic in geotechnical engineering, and great efforts have been made to evaluate the resistance of soil to liquefaction. There is currently a lack of machine learning applications specifically for smart cities in areas such as geological hazards. This study uses two machine learning techniques, artificial neural networks and ensemble learning, to obtain a prediction model with high performance in predicting the bearing layer depth to improve the accuracy of geo-engineering surveys. The model was developed by analyzing actual survey data from 433 locations in Setegaya, Tokyo, by using artificial neural networks (ANNs) and bagging, respectively. The results show that machine learning has great advantages in predicting the bearing layer depth. In addition, compared with a single model such as artificial neural networks, the prediction performance of ensemble learning can be improved by about 20%. Both interdisciplinary approaches can help predict address risks and thus promote sustainable urban development, highlighting the potential of smart cities in the future.

Accurate forecasting of icing thickness has a great significance for ensuring the security and stability of power grid. In order to improve the forecasting accuracy, this paper proposes an icing forecasting system based on fireworks algorithm and weighted least square support vector machine (W-LSSVM). The method of fireworks algorithm is employed to select the proper input features with the purpose of eliminating the redundant influence. In addition, the aim of W-LSSVM model is to train and test the historical data-set with the selected features. The capability of this proposed icing forecasting model and framework is tested through the simulation experiments using real-world icing data from monitoring center of key laboratory of anti-ice disaster, Hunan, South China. The results show that the proposed W-LSSVM-FA method has a higher prediction accuracy and it may be a promising alternative for icing thickness forecasting.

Recently, methods to detect DoS and spoofing attacks that occur on in-vehicle networks using CAN Protocol are being studied through deep learning models such as CNN, RNN, and LSTM. These studies have produced significant results in the field of In-Vehicle Network attack detection using deep learning models. In addition, significant results are being achieved through research on applying time series-based deep learning models such as LSTM to detect DoS attacks and replay attacks occurring in in-drone networks by expanding them to drones using the UAVCAN protocol. In this paper, we conducted an experiment to detect in-drone network attacks through non-time series analysis using machine learning models and deep learning models, and through appropriate learning for each attack type, it can also be analyzed through non-time series analysis. The results showed that it was possible to detect attacks.

Ranked Set Sampling (RSS) is a useful technique for improving the estimator of population mean when the sampling units in a study can be easily ranked than the actual measurement. RSS performs better than simple random sampling (SRS) when the mean of units corresponding to each rank is used. The performance of RSS can be increased further by assigning weights to the ranked observations. In this paper, we propose weighted RSS procedures to estimate the population mean of positively skew distributions. It is shown that the gain in the relative precisions of the population mean for chosen distributions are uniformly higher than those based on RSS. The gains in relative precisions are substantially high. Further, the relative precisions of our estimator are slightly higher than the ones based on Neyman’s optimal allocation model for small sample sizes. Moreover, it is shown that, the performance of the proposed estimator increases as the skewness increases by using the example of lognormal family of distributions.

In this paper, we introduce the notion of weighted generalized group inverse in a Banach algebra with proper involution. This is a natural generalization of weighted weak group inverse for a complex matrix and Hilbert space operator. We present several characterizations and representations of this generalized inverse. In addition, a new partial order on elements in a Banach *-algebra is investigated by using the weighted generalized group inverse and some known results are thus generalized.

In this paper, we study the weighted reproducing kernels. We introduce a generalization of weighted reproducing property and extend it to relative reproducing property on Banach spaces. This generalization will develop the parallel computing and it can be used as a base of parallel learning for machines especially in the case that there are non-homogenous weighted hypothesis. This methods formulate learning and estimation problems in a relative reproducing kernel Banach space (RRKBS) of functions defined on the data domain, expanded in terms of a kernel.

Purpose of this article is to introduce a modification of Phillips operators on the interval $\left[ \frac{1}{2},\infty \right) $ via Dunkl generalization. This type of modification enables a better error estimation on the interval $\left[ \frac{1}{2},\infty \right) $ rather than the classical Dunkl Phillips operators on $\left[ 0,\infty \right) $. We discuss the convergence results and obtain the degrees of approximations. Furthermore, we calculate the rate of convergence by means of modulus of continuity, Lipschitz type maximal functions, Peetre's $K$-functional and second order modulus of continuity.

Purpose of this article is to introduce a modification of Phillips operators on the interval $\left[ \frac{1}{2}% ,\infty \right) $ via Dunkl generalization. This type of modification enables a better error estimation on the interval $\left[ \frac{1}{2},\infty \right) $ rather than the classical Dunkl Phillips operators on $\left[ 0,\infty \right) $. We discuss the convergence results and obtain the degrees of approximations. Furthermore, we calculate the rate of convergence by means of modulus of continuity, Lipschitz type maximal functions, Peetre's $K$-functional and second order modulus of continuity.

This work compared the performance of three methods for constructing a regional ensemble prediction system (EPS) for wind speed forecasts: dynamical downscaling, breeding of growth modes (BGM), and blending method. The Weather Research and Forecasting (WRF) model was used to downscale the European Centre for Medium-range Weather Forecast (ECMWF) EPS. In addition, as the BGM method needs observation data for generating scaling factors, an alternative method for generating scaling factors was proposed to eliminate dependence on observation data. One-month tests between October 1st and October 30th, 2020, were implemented to evaluate the performance of three methods in the Gansu province of China. The results demonstrate that the blending method outperforms the other two methods. Furthermore, the difference in performance is evident mainly in early forecast lead time and becomes negligible as forecast time increases.

Traffic Inspection (TI) work in this article is positioned as a specific module of road traffic with its primary function oriented towards monitoring and controlling safe traffic and the execution of significant events within a particular geographic area. Exploratory research on the significance of event execution in simple, complicated and complex traffic flow and process situations is related to the activities of monitoring and controlling functional states and performance of categorical variables, which include objects and locations of road infrastructure, communication infrastructure and networks of traffic inspection resources. It is emphasized that the words “work” and “traffic” have the semantic status as synonyms (in one world language), which is explained in the design of the Agent-based model of the complexity of content and contextual structure of TI work at the singular and plural level with 12 points of interest (POI) in the thematic research. An Event Execution Log (EEL) was created for on-site data collection with eight variables, seven of which are independent (event type, activities, objects, locations, host, duration-period and periodicity of the event) and one dependent (significance of the event) variable. The structured data set includes 10,994 input-output vectors in 970 categories collected in the EEL created by 32 human agents (traffic inspectors) over a 30-day period. An algorithmic presentation of the methodological research procedure for preprocessing and final data processing in the ensemble of machine learning models for classification and selection of TI tasks is given. Data cleaning was performed on the available dataset to increase data consistency for further processing. Vector elimination was carried out based on the Location variable, such that the total number of vectors equals the number of unique categories of this variable, which is 636. The main result of this research is the Classification modeling of the significance of events in TI work based on machine learning techniques and the Stacking ensemble. The created machine learning models for event significance classification modeling have high accuracy values. To evaluate the performance metrics of the Stacking ensemble of models, the confusion matrix, Precision, Recall, ND F1-score are used.

In this paper we establish some weighted integral inequalities of Ostrowski, Čebyšev and Lupaş type. Applications for continuous probability density functions supported on infinite intervals with two examples are also given.

The heterogeneous structure implies that a few nodes may be crucial in maintaining network structural and functional properties. Identifying these crucial nodes correctly and quickly is a primary issue as contemporarily may face the mushrooming of large-scale datasets. Besides, the ‘weight issue’ is always ignored in this field which edge weight may play a positive/negative role in contributing to the node importance in different weighted networks. This paper provides a novel algorithm, Weighted Expectation Algorithm (WEA), which aims to ensure accuracy and speed of computation by taking advantage of dynamic programming to better handle the task of large-scale networks. Additionally, the weight issue that edge weights may contribute differently is addressed by a simply quantitative definition. Two standard experiments show WEA can maintain the network structure in connectivity well (by the lowest average robustness 0.192) and identify the node importance better in the spreading function test of spreading dynamics (by the highest average Kendall’s tau-b 0.678). In addition, the time complexities of different algo-rithms are evaluated, and their time-consuming are tested, proving that WEA consumes a rela-tively short time.

We have estimated the level of Risk Weighted Assets among 30 countries in Europe, in 30 trimesters, using data of the European Banking Authority-EBA of 139 variables. We perform an econometric model using Pooled OLS, Panel Data with Fixed Effects, Panel Data with Random Effects, Weighted Least Squares. We found that Risk Weighted Assets is negatively associated, among others, to the level of NFC loans in mining and quarrying, in public administration and defence, and in financial and insurance activities and positively associated, among others to distribution of NFC loans in human health services and social work activities, in education and the level of net fee and commission income. Furthermore, we apply a cluster analysis with the k-Means algorithm, and we find the presence of two clusters. A comparison was then made between eight different machine learning algorithms for predicting the value of the RWAs and we found that the best predictor is the linear regression. The RWA value is predicted to increase by 1.5%.

Aiming at the defects of low precision and time cumulative error, an external wireless signal weighted centroid localization algorithm aided inertial positioning method is designed in this paper. According to the signal strength of each anchor node received at the test point, the distance between the anchor node and the anchor node is obtained by using the attenuation model of the wireless signal. Three anchor nodes are used to measure the distance between the anchor node and the measured point. We can obtain the area to be measured according to the actual situation, the position of the measured point is obtained by the weighted centroid localization algorithm and a combined model of wireless signal aided inertial navigation system is established. The simulation results show that the method can greatly improve the positioning accuracy and restrain the divergence of the longitude error and latitude error.

Software project estimating (SPE) is a powerful but necessary step in the production of projects for software. Software project estimating includes several components, estimating software time, software resources, software costs, and software effort estimation (SEE). SEE seeks to estimate the number of "hours-person" and "months-person" of work required for developing or managing a software program. During the initial phase of the development of software, future efforts are impossible to predict. To estimate effort, many deep learning (DL) and machine learning (ML) models were previously created. For estimate, single-model techniques and ensemble methods were investigated in this research. Ensemble methods involve a combination of multiple separate models. Bagging, boosting, and voting were the ensemble methods looked into for estimation. Datasets considered for estimation were COCOMO81, COCOMONasa I, COCOMONasa II, Albrecht, Maxwell, China, Desharnais, Desharnais_1_1, Kitchenham, Boehm, and Belady. The evaluation criteria used MAE, RAE, RMSE, RRSE, and CC. The result from previous studies is that the total size of the set of data utilized is small in predicting the effort, as the largest size of the set of data used is the China dataset containing only 499 projects. So, in this study, the dataset has been merged to increase the total size of the set of data and increase the accuracy of prediction. The results indicated that the suggested merged dataset increased effort estimation accuracy.

Multilabel learning goes beyond standard supervised learning models by associating a sample with more than one class label. Among the many techniques developed in the last decade to handle multilabel learning best approaches are those harnessing the power of ensembles and deep learners. This work proposes merging both methods by combining a set of gated recurrent units, temporal convolutional neural networks, and long short-term memory networks trained with variants of the Adam optimization approach. We examine many Adam variants, each fundamentally based on the difference between present and past gradients, with step size adjusted for each parameter. We also combine Incorporating Multiple Clustering Centers and a bootstrap-aggregated decision trees ensemble, which is shown to further boost classification performance. In addition, we provide an ablation study for assessing the performance improvement that each module of our ensemble produces. Multiple experiments on a large set of datasets representing a wide variety of multilabel tasks demonstrate the robustness of our best ensemble, which is shown to outperform the state-of-the-art. The MATLAB code for generating the best ensembles in the experimental section will be made available at https://github.com/LorisNanni.

In the radar system, detection represents a basic and important stage in the receiver side. The detection process is based on the thresholding criteria; two philosophies of this criteria, constant and adaptive threshold. The constant threshold is simple in design, but it has a mis-detection and does not control the false alarm rate. As for the adaptive threshold, it is powerful in target detection, and better control of the false alarm rate, where it is called Constant False Alarm Rate (CFAR). Lots of research in the CFAR design, but the gap in the previous works is that there is no CFAR algorithm can be working with all or most environmental fields and all or most target situations.In this paper, The CFAR, which can work with the most environment and most of the target situations, has been presented. The producing the design and implementation of the new practical CFAR processor is presented. Where, the new CFAR is a combination of the properties of three different CFAR algorithm (CA, OSGO, and OSSO), and from two different families; averaging and statistical. Where it has overperformed of it's is 97.25% for simulation and 96.25% for the implementable version for different target situations. The simulation analysis is made by using Matlab 2015, while the implementation is done by using Xilinx Spartan 700 3a.

Containing hundreds of spectral bands (features), hyperspectral images (HSIs) have high ability in discrimination of land cover classes. Traditional HSIs data processing methods consider the same importance for all bands in the original feature space (OFS), while different spectral bands play different roles in identification of samples of different classes. In order to explore the relative importance of each feature, we learn a weighting matrix and obtain the relative weighted feature space (RWFS) as an enriched feature space for HSIs data analysis in this paper. To overcome the difficulty of limited labeled samples which is common case in HSIs data analysis, we extend our method to semisupervised framework. To transfer available knowledge to unlabeled samples, we employ graph based clustering where low rank representation (LRR) is used to define the similarity function for graph. After construction the RWFS, any arbitrary dimension reduction method and classification algorithm can be employed in RWFS. The experimental results on two well-known HSIs data set show that some dimension reduction algorithms have better performance in the new weighted feature space.

In this short communication, following a brief introduction, we undertake a comprehensive analytical study of the weighted Simpson index. Our primary emphasis concerns the precise determination of the optimal point (minimizer) coordinates and of the minimum value of the index, a differentiable convex function, which is related to the harmonic mean concept. Furthermore, we address and solve the inversion problem and show the tight connection between both approaches. Last, we give some insights and final remarks on this subject.

Weighted Student Funding (WSF) systems have been implemented in various countries to give schools more autonomy over how to allocate their funding. School principals use funding to maintain school operations and foster innovation for achieving educational goals. However, despite the importance of this process, scholarly research has largely overlooked how principals make decisions about their financial resources. Accordingly, this study seeks to provide practical insights into the strategies used by one school by highlighting their staff’s perceptions about using their WSF to maintain school operations and spur innovation. Using a case study approach, we investigated a principal who effectively used a school’s WSF to transform a failing school into an innovative one. The findings revealed that the principal strategically implemented financial management mechanisms in a way that inspired teachers to deeply consider how a school's WSF can help achieve educational goals. The principal fostered consensus on the school's direction, encouraged innovation through hands-on experiential learning and strategic planning, and facilitated funding for innovative teachers by guiding proposal development. Insights into the shifting cultural and practical landscape of financial resource utilization within schools are discussed.

In this paper we provide amongst others some simple error bounds in approximating the weighted Riemann-Stieltjes integral $\int_{a}^{b}f\left(t\right) g\left(t\right) dv\left(t\right) $ by the use of three points formula \begin{equation*} f\left(b\right) \int_{c}^{b}g\left(s\right) dv\left(s\right) +f\left(a\right) \int_{a}^{d}g\left( s\right) dv\left( s\right) -f\left(x\right) \int_{c}^{d}g\left(t\right) dv\left(t\right) \end{equation*} where $x,$ $c,$ $d\in \left[a,b\right],$ $g,$ $v:\left[a,b\right] \rightarrow \mathbb{C}$ under bounded variation and Lipschitzian assumptions for the function $f$ and such that the involved Riemann-Stieltjes integrals exist.

This study introduces a new discrete distribution which is a weighted version of Poisson-Lindley distribution. The weighted distribution is obtained using the negative binomial weight function and can be fitted to count data with over-dispersion. The p.m.f., p.g.f. and simulation procedure of the new weighted distribution, namely weighted negative binomial Poisson-Lindley (WNBPL), are provided. The maximum likelihood method for parameter estimation is also presented. The WNBPL distribution is fitted to several insurance datasets, and is compared to the Poisson and negative binomial distributions in terms of several statistical tests.

Explosion monitoring is performed by infrasound and seismoacoustic sensor networks that are distributed globally, regionally, and locally. However, these networks are unevenly and sparsely distributed, especially in the local scale as maintaining and deploying networks is costly. With increasing interest in smaller yield explosions, the need for more dense networks has increased. To address this issue, we propose using smartphone sensors for explosion detection as they are cost-effective and easy to deploy. Although there are studies using smartphone sensors for explosion detection, the field is still in its infancy and new technologies need to be developed. We applied a machine learning model for explosion detection using smartphone microphones. The data used were from the Smartphone High-explosion Audio Recordings Dataset (SHAReD), a collection of 326 waveforms from 70 high-explosive (HE) events recorded on smartphones, and the ESC-50 dataset, a benchmarking dataset commonly used for environmental sound classification. Two machine learning models were trained and combined into an ensemble model for explosion detection. The resulting ensemble model classified audio signals as either “explosion,” “ambient,” or “other” with true positive rates (recall) greater than 96% for all three categories.

Link prediction is a significant field in network science, which focuses on predicting the probability of the existence or formation of a link between nodes in a social network based on currently observed connections. The effectiveness of traditional algorithms can vary depending on the type of network, making some methods more suitable than others for specific scenarios. Recently, several efficient link prediction algorithms have been developed, demonstrating robust results in both prediction accuracy and interpretability. However, existing research has not clearly established the relationship between network characteristics and link creation mechanisms for community influence analysis and anomaly detection. The ability to predict complex networks with diverse features still requires further investigation. In light of this, we introduce a novel framework designed to combine the best features of different link prediction algorithms when applied to the network, with the aim of achieving more reliable predictions about how networks will evolve. According to the proposed framework, we first focus on the feature extraction stage. During this phase, we systematically identify and extract a comprehensive set of features from the network before moving onto the classification phase. Here, we utilize state-of-the-art ensemble learning models to assess and classify potential links within the network. By training our machine learning models on the extracted features, we can effectively predict whether a particular link is likely to form (positive link) or unlikely to form (negative link). The ML models were trained and evaluated using two datasets: Twitch and Facebook. Results: Additionally, we assessed their performance on these datasets by conducting specific preprocessing and hyperparameter tuning steps. The final prediction model achieves AUC values between 94% and 99.3%. This research contributes significantly to efforts aimed at enhancing link prediction in dynamic socisal network contexts, providing valuable insights into the effectiveness of different ML algorithms in predicting future connections and enhancing our understanding of network dynamics.

This paper explores the utilization of ensemble models and learning analytics techniques to predict student academic performance. With the advent of educational big data, institutions are increasingly leveraging advanced analytics to gain insights into student learning patterns and optimize educational outcomes. Ensemble models, which combine the predictive power of multiple algorithms, offer a robust approach to enhance prediction accuracy. The performance of the ensemble models was analyzed and compared using the Open University Learning Analytics Dataset, which consists of sources such as demographic information, historical performance data, and engagement metrics for 23,344 students. The evaluation of various ensemble models across different classification scenarios revealed that the proposed stacking model consistently emerges as the best-performing model, excelling in both multi-class and binary classification tasks.

Object classification is a crucial task in deep learning, which involves the identification and categorization of objects in images or videos. Although humans can easily recognize common objects, such as cars, animals, or plants, performing this task on a large scale can be time-consuming and error-prone. Therefore, automating this process using neural networks can save time and effort while achieving higher accuracy. Our study focuses on the classification step of human chromosome karyotyping, an important medical procedure that helps diagnose genetic disorders. Traditionally, this task is performed manually by expert cytologists, which is a time-consuming process that requires specialized medical skills. Therefore, automating it through deep learning can be immensely useful. To accomplish this, we implemented and adapted existing preprocessing and data augmentation techniques to prepare the chromosome images for classification. We used ResNet-50 convolutional neural networks and an ensemble approach to classify the chromosomes, obtaining state-of-the-art performance in the tested dataset.

The conventional machine learning (ML) algorithms are continuously advancing and evolving at a fast-paced by introducing the novel learning algorithms. ML models are continually improving using hybridization and ensemble techniques to empower computation, functionality, robustness, and accuracy aspects of modeling. Currently, numerous hybrid and ensemble ML models have been introduced. However, they have not been surveyed in a comprehensive manner. This paper presents the state of the art of novel ML models and their performance and application domains through a novel taxonomy.

Developing effective trend estimators is a main method to solve the online portfolio selection problem. Although the existing portfolio strategies have demonstrated good performance through the development of various trend estimators, it is still challenging to determine in advance which estimator will yield the maximum final cumulative wealth in online portfolio selection tasks. This paper studies an online ensemble approach for online portfolio selection by leveraging the strengths of multiple trend estimators. Specifically, a return-based loss function and a cross-entropy-based loss function are first designed to evaluate the adaptiveness of different trend estimators in a financial environment. On this basis, a passive aggressive ensemble model is proposed to weigh these trend estimators within a unit simplex according to their adaptiveness. Extensive experiments are conducted on benchmark datasets from various real-world stock markets to evaluate the performance. The results show that the proposed strategy achieves the state-of-the-art performance including efficiency and cumulative return.

We propose a new ensemble classification algorithm, named Super Random Subspace Ensemble (Super RaSE), to tackle the sparse classification problem. The proposed algorithm is motivated by the Random Subspace Ensemble algorithm (RaSE). The RaSE method was shown to be a flexible framework that can be coupled with any existing base classification. However, the success of RaSE largely depends on the proper choice of the base classifier, which is unfortunately unknown to us. In this work, we show that Super RaSE avoids the need to choose a base classifier by randomly sampling a collection of classifiers together with the subspace. As a result, Super RaSE is more flexible and robust than RaSE. In addition to the vanilla Super RaSE, we also develop the iterative Super RaSE, which adaptively changes the base classifier distribution as well as the subspace distribution. We show the Super RaSE algorithm and its iterative version perform competitively for a wide range of simulated datasets and two real data examples. The new Super RaSE algorithm and its iterative version are implemented in a new version of the R package RaSEn.

In this paper, we propose methods for brain tumor detection in MRI images based on ensemble learning. We build upon prior research on ensemble methods by testing the concatenation of pre-trained models: features extracted via transfer learning are merged and segmented by classification algorithms or a stacked ensemble of those algorithms. The proposed approach achieved accuracy scores of 0.98 , outperforming a benchmark VGG-16 model. Considerations to granular computing are given in the paper as well.

Prostate cancer (PCa) is the most diagnosed non-cutaneous cancer in men. Despite therapies such as radical prostatectomy, which is considered curative, distant metastases may form resulting in biochemical recurrence (BCR). This study used radiomic features calculated from multi-parametric magnetic resonance imaging (MP-MRI) to evaluate their ability to predict BCR and PCa presence. Data from a total of 279 patients, of which 46 experienced BCR, undergoing MP-MRI prior to surgery were assessed for this study. After surgery, the prostate was sectioned using patient-specific 3D-printed slicing jigs modeled using the T2-weighted imaging (T2WI). Sectioned tissue was stained, digitized, and annotated by a GU-fellowship trained pathologist for cancer presence. Digitized slides and annotations were co-registered to the T2WI and radiomic features were calculated across the whole prostate and cancerous lesions. A tree regression model was fitted to assess the ability of radiomic features to predict BCR, and a tree classification model was fitted with the same radiomic features to classify regions of cancer. We found that 10 radiomic features predict eventual BCR with an AUC of 0.97 and classifying cancer at an accuracy of 89.9%. This study showcases the application for a radiomics-based tool to screen for the presence of prostate cancer and assess patient prognosis, as determined by biochemical recurrence.

Power law relationships, which describe scaling relationships of data, are powerful information theoretic descriptive tools in many empirical contexts, including that of music. Zipf’s law (pink noise) describes the optimum case of a power law relation where observations are exactly inversely proportional to their rank. Descriptions that approximate a pink noise signature can be said to maximize the amount of information in a signal, and is thus suggestive of a richness of an understanding. This information density of pink noise signatures is not, however, necessarily a desirable quality for explanations in general, which, by definition, “flattens out” some data while highlighting others, ideally those most relevant to an interpretation. The privileging of data most relevant to comprehension corresponds to a red noise relationship, as opposed to the pink noise of Zipf’s law or the white noise of a description that highlights nothing in particular. Here, I explore and evaluate this concept of red noise explanations in the form of analyses of three comparable short piano works: Robert Schumann’s “Von fremden Ländern und Menschen” (no.1 from Kinderszenen op. 15, 1838), Frédéric Chopin’s Prelude op. 28 no. 20 (1838-9), and Felix Mendelssohn’s “Venetianisches Gondellied” (no. 6 from Lieder ohne Worte op. 19b, 1829-30).

Background and Objectives: The existing recommendations for female pelvic magnetic susceptibility weighted imaging MRI (FP-SWI) have not been optimized to capture the disease characteristics of the female pelvis. Therefore, it is imperative to explore acquisition parameters before conducting larger-scale studies. To establish optimized flip angle (FA) for acquiring FP-SWI to improve the image quality of female pelvic lesion sites. Materials and Methods: To evaluate signal quality and lesion conspicuity, regions of interest (ROIs) were manually drawn within the lesion on SWI sequences. Signal intensity was measured within the ROIs. Additionally, signal-to-noise ratio (SNR) and contrast-to-noise ratio (CNR) were calculated for SWI sequences acquired at three FA: 10°, 15°, and 20°. Finally, a qualitative assessment of anatomical detail visualization, geometric distortion extent, artifacts, and lesion clarity was performed using a four-point scale. The Wilcoxon rank sum test was employed to compare the qualitative evaluation parameters. The intra-class correlation coefficient (ICC) was calculated to determine the consistency of subjective ratings between two observers. Results: FA=10° showed significantly higher SNR than FA=15° and 20° in most anatomical regions (P&lt;0.05), while the CNR was significantly higher than FA=15° and 20° (P&lt;0.05). Compared with FA=15° and 20°, the image quality of FA=10° was significantly higher, with less distortion and ghosting, and better image contrast (P&lt;0.05). Lesions with FA=10° exhibited higher clarity compared to FA=15° and 20° (P&lt;0.05). Conclusions: The image quality of FP-SWI images at FA=10° exceeds that at FA=15° and 20°. We recommend that when conducting SWI examination of the female pelvic cavity, the FA value should be set at 10° to stabilize the SWI sequence and improve image quality.

We investigate \texorpdfstring{$L_2$}{}-approximation problems in the worst case setting in the weighted Hilbert spaces \texorpdfstring{$H(K_{R_{d,\a,\g}})$}{} with weights \texorpdfstring{$R_{d,\a,{\bm \ga}}$}{} under parameters \texorpdfstring{$1\ge \ga_1\ge \ga_2\ge \cdots\ge 0$ and $1<\az_1\le \az_2\le \cdots$}{}. Several interesting weighted Hilbert spaces \texorpdfstring{$H(K_{R_{d,\a,\g}})$}{} appear in this paper. We consider the worst case error of algorithms that use finitely many arbitrary continuous linear functionals. Multivariate approximation; information complexity; tractability; weighted Hilbert spacesWe discuss tractability of \texorpdfstring{$L_2$}{}-approximation problems for the involved Hilbert spaces, which describes how the information complexity depends on \texorpdfstring{$d$}{} and \texorpdfstring{$\va^{-1}$}{}. As a consequence we study the strongly polynomial tractability (SPT), polynomial tractability (PT), weak tractability (WT), and \texorpdfstring{$(t_1,t_2)$}{}-weak tractability (\texorpdfstring{$(t_1,t_2)$}{}-WT) for all \texorpdfstring{$t_1>1$}{} and \texorpdfstring{$t_2>0$}{} in terms of the introduced weights under the absolute error criterion or the normalized error criterion.

To effectively preserve marine environments and manage endangered species, it is necessary to employ efficient, precise, and scalable solutions for environmental monitoring. Ecoacoustics provides several benefits as it enables non-intrusive, prolonged sampling of environmental sounds, making it a promising tool for conducting biodiversity surveys. However, analyzing and interpreting acoustic data can be time-consuming and often demands substantial human supervision. This challenge can be addressed by harnessing contemporary methods for automated audio signal analysis, which have exhibited remarkable performance due to advancements in deep learning research. This paper introduces a research investigation into developing an automatic computerized system to detect dolphin whistles. The proposed method utilizes a fusion of various resnet50 networks integrated with data augmentation techniques. Through extensive experiments conducted on a publically available benchmark, our findings demonstrate that our ensemble yields significant performance enhancements across all evaluated metrics. The MATLAB/PyTorch source code is freely available at: https://github.com/LorisNanni/

Lower Back Pain (LBP) is a disease that needs immediate attention. Person with back pain shall go immediately to doctor for treatment. Injury, excessive works and some medical conditions are result of back pain. Back pain is common to any age of human for different reasons. Due to factors such as previous occupation and degenerative disk disease the chance of developing lower back pain increases for older people. It hampers the working condition of people common reason for seeking medical treatment. The result is absence from work and is unable to normal due to pain. It creates uncomfortable and debilitating situations. Hence, detecting this disease at an early stage will assist the medical field experts to suggest counter measures to the patients. Detection of lower back pain is implemented in this paper by applying ensemble machine learning technique. This paper proposes Stacking ensemble classifier as an automated tool that will predict lower back pain tendency of a patient. Experimental result implies that the proposed method reaches an accuracy of 76.34%, f1-score of 0.76 and MSE of 0.34.

Background. To describe the characteristics of anterior mediastinal masses on conventional magnetic resonance imaging (MRI) and to assess the role of the Apparent Diffusion Coefficient (ADC) value in distinguishing benign from malignant mediastinal lesions. Methods. We conducted a retrospective cross-sectional study on 55 patients with anterior mediastinal mass who performed MRI before treatment. Biopsy and histopathological assessments were done after that. A radiologist evaluates the changes of signal intensity on these sequences: T1- weighted VIBE DIXON pre and post-contrast with Gadolinium, T2 HASTE, T2 TIRM, DWI/ADC, to determine the size, margin of the lesion, the presence of fat, cystic in it. ADCs values were calculated from the ADC maps which were constructed from b = 0 and b = 2000 Results. The study was composed of 55 patients, with 5 benign lesions and 50 malignant lesions. The ADCmean, ADCmedian, ADC10, and ADC90 in the histogram-based approach and hot-spot-ROI-based mean ADC for the malignant lesions was significantly lower than those found in benign lesions (P-value <0.05). The hot-spot-ROI-based mean ADC had the highest value in differentiation between benign and malignant mediastinal lesions, between group A (benign lesions, thymoma A, AB, B1) and group B (thymoma B2, B3 and other malignant lesions). The cut-off point of the ADC value differentiating malignant from benign mediastinal lesions was 1,17x10-3mm2/s with sensitivity of 80%, and specificity of 80%. The cut off point of the ADC value differentiating group A from group B was 0.99 x10-3mm2/s with sensitivity of 78,4%, and specificity of 88.9%. The cut-off point of the ADC value differentiating lymphoma from other malignant lesions was 0,91 x10-3mm2/s with sensitivity of 100%, and specificity of 60.5%. Conclusion. Diffusion-weighted MRI and measurement of ADC value in histogram-based approach and hot-spot-ROI-based mean ADC are very helpful in the differentiation between benign and malignant anterior mediastinal lesions.

This study evaluates the effectiveness of Darknet53 and VGG16 pretrained models to develop a hybrid ensemble model named HybridPlantNet23 deep learning model for effective plant disease classification, using the publicly available dataset ‘A Dataset of Leaf Images’ from Mendeley webpage. The preprocessing of the dataset involved resizing the images to the respective requirements of the pretrained models to develop a combined datastore which served as the input. All experiments were conducted using MATLAB R2023b deep network designer interface. Model performances were evaluated based on the conventional accuracy, precision, recall, and F1-score. VGG16 achieved the highest accuracy (97.25%), precision (96.30%), recall (96.96%), and F1-score (96.55%), outperforming both Darknet53 and the ensemble HybridPlantNet23 model. Despite the advanced architecture of the ensemble model, its performance (accuracy: 95.37%, precision: 93.56%, recall: 94.20%, F1-score: 93.74%) was not significantly superior, thus highlighting scientific reasons behind this development. Recommendations for future works were provided accordingly.

Artistic image completion is fundamental for the preservation and restoration of invaluable art paintings and it has experienced significant progress through the implementation of deep learning methodologies. Despite these advancements, challenges persist, even with sophisticated approaches like Generative Adversarial Networks (GANs), particularly in achieving optimal results for high-resolution paintings. Small-scale texture synthesis and the inference of missing information from distant contexts present persistent issues, leading to distortions in lines and unnatural colors, especially in art paintings with complicated structures and textures. Concurrently, patch-based image synthesis has evolved by incorporating global optimization on the image pyramid to enhance structural coherence and details. However, methods relying on gradient-based synthesis encounter obstacles related to directionality, inconsistency, and the heavy computational burdens associated with solving the Poisson equation in non-integrable gradient fields. This paper introduces a groundbreaking approach, integrating Weighted Similarity-Confidence Laplacian Synthesis, to comprehensively address these challenges and advance the field of artistic image completion. This proposal addresses challenges not only in high-resolution artistic image completion but also makes a significant contribution to the broader field of patch-based synthesis by utilizing the Laplacian pyramid for enhanced edge-aware correspondence search. Experimental result confirms the effectiveness of our approach, offering promising outcomes for the preservation and restoration of art paintings with complicated details and irregular missing regions.

One of the most important applications in the wireless sensor networks (WSN) is to classify mobile targets in the monitoring area. In this paper, a multi-DBN weighted voting classification algorithm is proposed on the basis of the Deep Belief Network (DBN) classifier and combined with the idea of voting method, which is implemented on the nodes of the WSN monitoring system by means of "upper training, lower transplantation" appraoch. The performance of the algorithm is verified by using real-world experimental data, and the results show that the proposed method has a higher accuracy in classifying the target signal features, achieving an average classification accuracy of 84.63% across four different types of moving targets. The experiment reveals that the multi-DBN weighted voting algorithm enhances the target classification accuracy by approximately 5% in comparison to the single DBN classifier, but the memory and computation time required for the algorithm to run are also increased at the same time. Compared to the FFNN classifier, which exhibited the highest classification accuracy among the four selected methods, the algorithm achieves an improvement of approximately 8.8% in classification accuracy. However, it incurs greater time overhead to run.

The assessment outcomes of regional susceptibility to geological disasters can directly indicate the extent and intensity of risks within the study area, thus, providing targeted guidance for disaster management efforts. This study selects eight evaluation indicators, namely elevation, gradient, terrain relief, lithology of strata, normalized difference vegetation index, distance from the fault, distance from road, and distance from the river. The study focuses on Huize County in Yunnan Province as the research area, utilizing the certainty factor (CF) and random forest (RF) models for evaluating the susceptibility to geological disasters. The non-geological disaster points in the study area are determined using the deterministic coefficient prior model, and the deterministic coefficient values for each evaluation factor serve as the classification data for the random forest model. The optimal parameters for the random forest are selected through iterative calculations of bag error in PyCharm, while the weight of the evaluation factor is determined based on the ran-dom forest model with the optimal parameters. The results of geological disaster susceptibility zoning in Huize County are obtained by overlaying the weighted deterministic coefficients of each evaluation factor. The accuracy of the evaluation results is verified using zoning statistics and ROC curves with a test sample of 30% of the points. The results demonstrate the high accuracy of the model in evaluating the susceptibility to geological disasters in Huize County. Compared to the single deterministic coefficient model, this approach offers advantages in terms of reliability and accuracy. The evaluation results can serve as a scientific reference for related work in Huize County.

The airport ground handling services (AGHS) equipment supplier selection problem involves a safety guarantee on the part of the AGHS company that carries out the daily work. AGHS company can prevent aircraft damage and delays in airlines schedules, and ensure reliable and high-quality ground handling service. In our research, we developed an AGHS equipment supplier selection model based on the analytic hierarchy process and an AHP weighted fuzzy linear programming approach, and we solved the AGHS equipment supplier’s selection problem. The main objective of this article is to create an AHP and AHP-FLP decision model in order to help the AGHS company authorities select the best AGHS equipment supplier. The practical application in AGHS equipment supplier selection decisions can be interpreted as demonstrating that the proposed model provides knowledge and practical value for the AGHS industry.

In this paper, we introduce deboost, a Python library devoted to weighted distance ensembling of predictions for regression and classification tasks. Its backbone resides on the scikit-learn library for default models and data preprocessing functions. It offers flexible choices of models for the ensemble as long as they contain the predict method, like the models available from scikit-learn. deboost is released under the MIT open-source license and can be downloaded from the Python Package Index (PyPI) at https://pypi.org/project/deboost. The source scripts are also available on a GitHub repository at https://github.com/weihao94/DEBoost.

Assume that $f:C\rightarrow \mathbb{R}$ is subadditive (superadditive) and hemi-Lebesgue integrable on $C,$ a cone in the linear space $X$ with $0\in C. $ Then for all $x,$ $y\in C$ and a symmetric Lebesgue integrable and nonnegative function $p:\left[ 0,1\right] \rightarrow \lbrack 0,\infty ),$ \begin{align*} \frac{1}{2}f\left( x+y\right) \int_{0}^{1}p\left( t\right) dt& \leq \left( \geq \right) \int_{0}^{1}p\left( t\right) f\left( \left( 1-t\right) x+ty\right) dt \\ & \leq \left( \geq \right) \int_{0}^{1}p\left( t\right) f\left( tx\right) dt+\int_{0}^{1}p\left( t\right) f\left( ty\right) dt. \end{align*} In particular, for $p\equiv 1,$ we have \begin{equation*} \frac{1}{2}f\left( x+y\right) \leq \left( \geq \right) \int_{0}^{1}f\left( \left( 1-t\right) x+ty\right) dt\leq \left( \geq \right) \int_{0}^{1}f\left( tx\right) dt+\int_{0}^{1}f\left( ty\right) dt. \end{equation*} Some particular inequalities related to Jensen's dicrete inequality for convex functions are also given.

The study combines two critical aspects of climate research in Nigeria. The first segment focuses on improving predictive performance of global circulation models (GCMs) employing ensemble techniques. ANN ensemble displayed significant improvement in the accuracy of climate projections, particularly in high-altitude geographic areas where traditional models exhibit limitations. Performance evaluation metrics such as Mean Absolute Error (MAE), Root Mean Squared Error (RMSE), and Nash–Sutcliffe Efficiency (NSE) demonstrate the effectiveness of the ANN multimodal ensemble. Building on the improved climate modelling, the second segment delves into a spatial and temporal analysis of rainfall and mean temperature patterns under climate change in Nigeria. By considering two Representative Concentration Pathways (RCPs), namely RCP4.5 and RCP8.5, the study utilizes dynamically downscaled GCMs obtained from the Coupled Model Intercomparison Project phase 5 (CMIP5). The Mann-Kendall test reveals significant spatiotemporal variations in climate trends across the country. The warming trend is particularly pronounced in the northern regions, with RCP8.5 showing more severe impacts compared to RCP4.5. This integrated approach not only highlights the importance of multimodal ensembles in climate modelling but also provides valuable insights into the spatial and temporal patterns of climate change to inform effective adaptation and mitigation strategies for Nigeria.

In this paper, solar irradiance and wind speed forecasts were performed considering time horizons ranging from 10 min to 60 min, under a 10 min time-step. Global horizontal irradiance (GHI) and wind speed were computed using four forecasting models (Random Forest, k-Nearest Neighbours, Support Vector Regression, and Elastic Net) to compare their performance against two alternative dynamic ensemble methods (windowing and arbitrating). Forecasting models and dynamic forecasting ensembles were implemented in Python for performance evaluation. The performance comparison between the prediction models and the dynamic ensemble methods was carried out by evaluating the RMSE, MAE, R² and MAPE, to evaluate whether the dynamic ensemble forecasting method obtained greater. According to the results obtained windowing dynamic ensemble method was the most efficient among the tested. For the wind speed data, by varying its parameter λ (from 1 to 100), a variable performance profile was obtained, where from λ =1 to λ = 74, windowing proved to be the most efficient, reaching maximum efficiency for λ = 19. Windowing was the best method for the GHI analysis, reaching its best performance for λ = 1. The efficiency gain using windowing was 0.56% when using the wind speed model and 1.96% for GHI.

The administration of regional neuraxial analgesia for pain relief during labor is widely recognized as a safe and effective method involving medication delivery into the epidural or subarachnoid space in the lower back. This study proposes an innovative semantic image segmentation methodology emphasizing enhanced interpretability using convolutional Random Fourier Features and layer-wise weighted class-activation maps tailored explicitly for foot segmentation in regional analgesia monitoring. Namely, our contribution is twofold: i) a novel Random Fourier Features layer is introduced to deal with image data to enhance three well-known architectures (FCN, UNet, and ResUNet); ii) three novel quantitive measures are presented to evaluate the interpretability of a given deep learning model devoted to segmentation tasks. Our approach is rigorously evaluated on a demanding dataset of foot thermal images from pregnant women who received epidural anesthesia. Its small size and considerable variability characterize the dataset. Our validation results demonstrate that the proposed methodology not only achieves competitive foot segmentation performance but also significantly enhances the explainability of the process, rendering it well-suited for applications such as epidural insertion during labor.

The world health organisation (WHO) revealed approximately 280 million people in the world suffer from depression. Yet, existing studies on early-stage depression detection using machine learning (ML) techniques are limited. Prior studies have applied a single stand-alone algorithm which are unable to deal with data complexities, prone to overfitting and limited in generalisation. To this end, our paper examined the performance of several ML algorithms for early-stage depression detection using two benchmark social media datasets (D1 and D2). More specifically, we incorporated sentiment indicator to improve our model performance. Our experimental results showed that sentence bidirectional encoder representations from transformers (SBERT) numerical vectors fitted into stacking ensemble model achieved comparable F1 scores of 69% in dataset (D1) and 76% in dataset (D2). Our findings suggest that utilising sentiment indicators as additional feature for depression detection yields an improved model performance and thus, we recommend the development of depressive term corpus for future work.

Communication is a key method of expressing one's thoughts and opinions. Amongst many modalities, speech and writing are the most powerful and common forms of human communication. Analysing what and how people think has inherently been an interesting and progressive research domain. This includes bimodal sentiment analysis which is an emerging area in natural language processing (NLP) and has received a great deal of attention in recent years in a variety of areas including social opinion mining, health care, banking, and so on. At present, there are limited studies on bimodal conversational sentiment analysis as it proves to be a challenging area given the complex nature of the way humans express sentiment cues across various modalities. To address this gap, a comparison of the performance of multiple data modality models has been conducted on the MELD dataset, a widely-used dataset for benchmarking sentiment analysis within the research community. Our work then demonstrates the results of combining acoustic and linguistic representations. Lastly, our proposed neural network-based ensemble learning technique is employed over six transformer and deep learning-based models, achieving a State-Of-The-Art (SOTA) accuracy.

There are uncertainties associated with every phase of the stock assessment process, ranging from the collection of data, assessment model choice, model assumptions and interpretation of risk to the implementation of management advice. The dynamics of fish populations are complex, and our incomplete understanding of those dynamics (and limited observations of important mechanisms) necessitate that models are simpler than nature. The aim is for the model to capture enough of the dynamics to accurately estimate trends and abundance and to provide advice to managers about sustainable harvests. The \textit{status quo} approach to assessment modelling has been to identify the `best' model, based on diagnostics and model selection criteria, and to generate advice from that model, mostly ignoring advice from other model configurations regardless of how closely they performed relative to the chosen model. We review the suitability of the ensemble modelling paradigm to more fully capture uncertainty in stock assessment model building and the provision of advice. We recommend further research to evaluate potential gains in modelling performance and advice from the use of ensemble modelling, while also suggesting revisions to the formal process for reviewing models and providing advice to management bodies.

Software fault prediction is the very consequent research topic for software quality assurance. Data driven approaches provide robust mechanisms to deal with software fault prediction. However, the prediction performance of the model highly depends on the quality of dataset. Many software datasets suffers from the problem of class imbalance. In this regard, under-sampling is a popular data pre-processing method in dealing with class imbalance problem, Easy Ensemble (EE) present a robust approach to achieve a high classification rate and address the biasness towards majority class samples. However, imbalance class is not the only issue that harms performance of classifiers. Some noisy examples and irrelevant features may additionally reduce the rate of predictive accuracy of the classifier. In this paper, we proposed two-stage data pre-processing which incorporates feature selection and a new Rough set Easy Ensemble scheme. In feature selection stage, we eliminate the irrelevant features by feature ranking algorithm. In the second stage of a new Rough set Easy Ensemble by incorporating Rough K nearest neighbor rule filter (RK) afore executing Easy Ensemble (EE), named RKEE for short. RK can remove noisy examples from both minority and majority class. Experimental evaluation on real-world software projects, such as NASA and Eclipse dataset, is performed in order to demonstrate the effectiveness of our proposed approach. Furthermore, this paper comprehensively investigates the influencing factor in our approach. Such as, the impact of Rough set theory on noise-filter, the relationship between model performance and imbalance ratio etc. comprehensive experiments indicate that the proposed approach shows outstanding performance with significance in terms of area-under-the-curve (AUC).

This study delves into the realm of heuristic evaluation within usability testing, focusing on refining and applying a tailored algorithm that simplifies the implementation of the Analytic Hierarchy Process for heuristic prioritization. Addressing the prevalent challenge of disparate evaluation methodologies and the absence of a standardized process in usability testing, our research introduces a novel method that leverages the Analytic Hierarchy Process alongside a bespoke algorithm. This algorithm utilizes transitive properties for pairwise comparisons, significantly reducing the evaluative workload. This innovative approach facilitates the estimation of heuristic relevance irrespective of the number of items per heuristic or the item scale and streamlines the overall evaluation process. In addition to rigorous simulation testing of the tailored algorithm, we applied our method in a practical scenario, engaging seven usability experts in evaluating a web interface. This empirical application underscored our method’s capacity to diminish the requisite comparison count and spotlight areas of improvement for critically weighted yet underperforming heuristics. The outcomes of this study underscore the efficacy of our approach in enhancing the efficiency and organization of heuristic evaluations, paving the way for more structured and effective usability testing methodologies in future research endeavors.

The need to carry different items, which become an extra load, is a characteristic of trail running. The aim of this study is to determine physiological-metabolic changes produced by running with extra load. Four male well-trained trail runners completed three treadmill maximal metabolic tests carrying different loads (0% (L0), 5% (L5), and 10% (L10) of their body mass) in a weighted vest. Gasses exchange was monitored to assess ventilatory thresholds 1 (VT1), and 2 (VT2), zone of maximal fat oxidation, and peak oxygen consumption (VO2peak). Heart rate (HR), power and velocity (V) were tracked for comparing their behavior. A repeated measures ANOVA showed significant differences in V (p&lt;.001; ηp2= 0.910) as a limitation for reaching peak velocity (Vpeak) with L10 respect to L0 (p=0.001), and L5 (p=0.011). Power expression showed differences (p=0.068; ηp2= 0.592). It tended to be greater with L10 than L0 (p=0.057), despite achieving lower V. VT2 tended to occur at different %VO2peak (p=0.069; ηp2= 0.591). L5 VT2 was reached at higher %VO2peak than L0 (p=0.062), and L10 (p=0.071). ANOVA also showed a tendency to signification for V at this point (p= 0.098; ηp2= 0.538). In conclusion, L10 seems to limit Vpeak while L5 may delay VT2 expression.

The global rising demand for exploiting limited shared groundwater resources, coupled with significant water deficit, especially in arid and semi-arid regions, has led to escalating conflicts among stakeholders. As such, using Bankruptcy Theory methods can be an appropriate response to the reallocation of resources. This study introduces a novel approach to weighted Bankruptcy, where the relative importance of stakeholders is determined by their contributions to sustainable development, and the impact of their claims on the shared groundwater resources is considered. The framework is implemented in a two-level bankruptcy process including the plains and their beneficiaries (agriculture, drinking and industry). The proposed two-level weighted bankruptcy process applies to the Neyshabour-Ataiyeh-Sabzevar plains in Iran. The process is implemented for two scenarios including the Baseline scenario related to the present status of demands and the Future scenario associated with the estimated demands for the year 2041. To compare the weighted proposed method with the other weighted methods such as Proportional (WPRO), Constrained Equal Awards (WCEA), Pinile (WPIN), Talmud (WTAL), Constrained Equal Losses (WCEL), Modified Constrained Equal Losses (MWCEL), two categories including the deficit-based and resource-based approaches are considered. According to the stability analysis using the Bankruptcy Allocation Stability Index (BASI) method, among the deficit-based methods, the novel approach is chosen as the preferred method for the beneficiaries’ reallocation like the Sabzevar’s beneficiaries. Accordingly, it allocates 86.95%, 10.86% and 2.17% of the shared resource to the agricultural, drinking, and industrial demands, respectively. Among the resource-based methods, the WPIN method is selected for reallocation between the stakeholders and their beneficiaries in each level and scenario of reallocation. The novel approach offers a promising solution to the water resource reallocation problem, ensuring a more equitable and sustainable management of shared groundwater resources.

We study the efficient computation of power indices for weighted voting games with precoalitions amongst subsets of players (reflecting, e.g., ideological proximity) using the paradigm of dynamic programming. Starting from the state-of-the-art algorithms for computing the Banzhaf and Shapley-Shubik indices for weighted voting games we present a framework for fast algorithms for the three most common power indices with precoalitions, i.e. the Owen index, the Banzhaf-Owen index and the Symmetric Coalitional Banzhaf index, and point out why our new algorithms are applicable for large numbers of players. We discuss implementations of our algorithms for the three power indices with precoalitions in C++ and review computing times as well as storage requirements.

In this paper, using the discrete time model, we consider the average age of all files for a cached-files-updating system where a server generates N files and transmits them to a local cache. In order that the cached files are fresh, in each time slot the server updates files with certain probabilities. The age of one file or its age of information (AoI) is defined as the time the file stays in cache since it was last time sent to cache. Assume that each file in cache has corresponding request popularity. In this paper, we obtain the distribution function of the popularity-weighted average age over all files, which gives a complete description of this average age. For the random age of single file, both the mean and its distribution have been derived before by establishing a simple Markov chain. Using the same idea, we show that an N dimensional stochastic process can be constituted to characterize the changes of N file ages simultaneously. By solving the steady-state of the resulting process, we obtain the explicit expression of stationary probability for an arbitrary state-vector. Then, the distribution function of the popularity-weighted average age can be derived by mergering a proper set of stationary probabilities. For the possible applications, the distribution function can be utilized to calculate the probability that the average age violates certain statistical guarantee.

We propose an iterative scheme for feature-based positioning using a new weighted dissimilarity measure with the goal of reducing the impact of large errors among the measured or modeled features. The weights are computed from the location-dependent standard deviations of the features and stored as part of the reference fingerprint map (RFM). Spatial filtering and kernel smoothing of the kinematically collected raw data allow efficiently estimating the standard deviations during RFM generation. In the positioning stage, the weights control the contribution of each feature to the dissimilarity measure, which in turn quantifies the difference between the set of online measured features and the fingerprints stored in the RFM. Features with little variability contribute more to the estimated position than features with high variability. Iterations are necessary because the variability depends on the location, and the location is initially unknown when estimating the position. Using real WiFi signal strength data from extended test measurements with ground truth in an office building, we show that the standard deviations of these features vary considerably within the region of interest and are neither simple functions of the signal strength nor of the distances from the corresponding access points. This is the motivation to include the empirical standard deviations in the RFM. We then analyze the deviations of the estimated positions with and without the location-dependent weighting. In the present example the maximum radial positioning error from ground truth are reduced by 40% comparing to kNN without the weighted dissimilarity measure.

As the primary secondary tree species in Northeast China, Quercus mongolica possesses significant ecological and economic value. This study employed the Biomod2 platform in conjunction with ArcGIS spatial analysis to assess the potential suitable habitat distribution area of Q. mongolica under current climatic conditions. Furthermore, it forecasted the distribution range and niche changes of potentially suitable habitats for Q. mongolica from 2022 to 2090, and pinpointed the key environmental factors influencing its distribution. The findings reveal that the total potential suitable area for Q. mongolica covers 74,994.792 km², predominantly spread across Inner Mongolia, Heilongjiang, Jilin, and other regions. The primary determinants of suitable area distribution were peak temperature of hottest month, lowest temperature of coldest month and altitude. Under future climate scenarios, the potentially suitable habitats of Q. mongolica are anticipated to diminish to varying extents, with the distribution center exhibiting a tendency towards northward migration. Concurrently, the overlap among different climate scenarios is predicted to expand over time. This investigation facilitates a comprehensive understanding of Q. mongolica's adaptation to climate change, enabling informed adjustments and serving as a valuable reference for the preservation and sustainable management of Q. mongolica populations.

We prove a version of Ekeland Variational Principle (EkVP) in a weighted graph $G$ and its equivalence to Caristi fixed point theorem and to Takahashi minimization principle. The usual completeness and topological notions are replaced with some weaker versions expressed in terms of the graph $G$. The main tool used in the proof is the OSC property for sequences in a graph. Converse results, meaning the completeness of graphs for which one of these principles holds is also considered.

This research centres on advancing the utilisation of a novel Deep Ensemble model called RicEns-Net for predicting crop yields through sophisticated multi-modal data engineering. Initially, data for the study were acquired from Ernst \& Young (EY), a prominent global technology and management consulting firm, as part of their annual data science challenge (EY Open Science Challenge 2023). The predictive models leverage multi-modal data by integrating radar and optical-type remote sensing data alongside meteorological data to create supplementary features essential for predicting crop yield. The primary data features are derived from spectral indices extracted from Sentinel 2 satellites, while more advanced features are generated through combinations and interactions of these fundamental features. Furthermore, data from Sentinel 1 and 3, along with meteorological measurements such as surface temperature and rainfall, account for the intricate natural factors influencing crop yield, creating a comprehensive set of data features based on existing research. To tackle the complexity introduced by numerous data features, extensive data engineering was conducted to identify the most predictive features among 100+ and mitigate the "curse of dimensionality," resulting in 15 features from 5 different modalities. The proposed RicEns-Net comprises multiple machine learning algorithms in a deep ensemble approach to leverage the best features of each of these techniques, achieving optimal performance. The proposed model achieves an MAE value of 341 kg/Ha for prediction, surpassing the performance of the EY Open Science Challenge 2023 winner models and state-of-the-art deep/machine learning approaches.

Recent advancements in Artificial Intelligence (AI) and generative models have significantly accelerated the evolution of internet services. In data centers, where data is often distributed across multiple machines, leveraging these machines to expedite the training of machine learning applications is common. However, this approach incurs substantial communication overhead. To mitigate this, data compression techniques such as quantization, sparsification, and dimension reduction are gaining attention, especially with iterative training algorithms that frequently exchange gradients. With the advancement of FPGA technology, FPGA-based bump-in-the-wire network interface controllers (smartNICs) have demonstrated notable benefits for data centers, matching ASIC switches in port-to-port latency and capacity. However, FPGA-based switches often have spare hardware resources beyond their switching functions, which are typically wasted. we propose a novel architecture that integrates FPGA-based switches with ensemble learning methods, utilizing these spare resources on FPGA-based network switches. This architecture employs random projection as a compression method to accelerate machine learning tasks while maintaining high accuracy. Our system accelerates the training process for Multilayer Perceptron (MLP) models with a speedup of 2.1-6.7 times across four high-dimensional datasets. In addition, it leverages the Hamming distance metric for k-Nearest Neighbors (kNN) classification, combining random projection with Hamming encoding, to offload large-scale classification tasks from downstream servers. This achieves a worst-case speedup of 2.3-8.7 times and a memory reduction of 3.9-27.7 times compared to CPU-based kNN classifiers using cosine distance. Our architecture addresses the challenges of high-dimensional data processing and exemplifies the potential of AI-driven solutions in accelerating and optimizing internet services. Moreover, the programmability of FPGAs allows the system to adopt various compression methods, extending its applicability. Offloading tasks to FPGAs can significantly reduce query response times, showcasing a crucial step towards achieving greater levels of autonomic computing and the rapid evolution of internet systems.

Solar radiation corresponds to fundamental parameters for solar photovoltaic (PV) technology. Reliable solar radiation prediction became valuable to design solar PV systems, performance, operatively efficient planning, safety operation, grid dispatch and financial characteristics. However, high quality ground-based solar radiation measurements are scarce, especially for very short-term time horizon. Most of the existent studies trained the machine learning (ML) model used dataset with time horizon of 1-hour or day, very fewer studies have been reported using a dataset with a 1-mitute time horizon. In this study, a comprehensive evaluation of nine ensemble learning algorithms (ELA) is performed to estimate the solar radiation in Santo Domingo with a 1-minute time horizon dataset collected from a local weather station. The ensemble learning evaluated included seven homogeneous ensembles; Random Forest (RF), Extra Tree (ET), Adaptive Gradient Boosting (AGB), Gradient Boosting (GB), Extreme Gradient Boosting (XGB), Light Gradient Boosting (LGBM), Histogram-based Gradient Boosting (HGB) and heterogeneous ensemble named as Voting and Stacking. RF, ET, GB, HGB were combined to develop Voting and Stacking and Linear Regression (LR) was adopted in the second layer of the Stacking. Five technical metrics, Mean Squared Error (MSE), Root Mean Squared Error (RMSE), Mean Absolute Error (MAE), Mean Absolute Percentage Error (MAPE) and Coefficient of Determination (R2) were used as criteria to determine the prediction quality of the developed ensemble algorithms. Comparison of the results indicates that the HGB algorithm offers superior prediction performance among the homogeneous ensemble learning and overall, the Stacking provides the best accuracy with metric values of MSE=3218.27, RMSE= 56.73, MAE=29.87, MAPE=10.60, R2=0.964.

Among many research areas to which Ron Yager contributed are decision making under uncertainty (in particular, under interval and fuzzy uncertainty) and aggregation – where he proposed, analyzed, and utilized the use of Ordered Weighted Averaging (OWA). The OWA algorithm itself provides only a specific type of data aggregation. However, it turns out that if we allows several OWA stages one after another, we get a scheme with a universal approximation property – moreover, a scheme which is perfectly equivalent to deep neural networks. In this sense, Ron Yager can be viewed as a (grand)father of deep learning. We also show that the existing schemes for decision making under uncertainty are also naturally interpretable in OWA terms.

Predicting credit default risk is important to financial institutions, as accurately predicting the likelihood of a borrower defaulting on their loans will help to reduce financial losses, thereby maintaining profitability and stability. Although machine learning models have been used in assessing large applications with complex attributes for these predictions, there is still a need to identify the most effective techniques and to also address the issue of data imbalance. In this research, we conducted a comparative analysis of random forest, decision tree, SVM (Support Vector Machine), XGBoost (eXtreme Gradient Boosting), ADABoost (ADAptive Boosting) and multilayered perceptron with three-hidden layers, to predict credit default using loan data from LendingClub. Additionally, we also combined the model predictions using voting and stacking ensemble methods to enhance the models' performance. Furthermore, various sampling techniques was explored to handle the issue of class imbalance observed in the dataset, with the result showing that the balanced data performs better than the imbalanced data. Our proposed model achieved an accuracy of 93.7%, a precision of 95.6% and a recall of 95.5%, which shows the potential of ensemble methods in improving credit default predictions and can provide lending platforms with the tool to reduce default rates and financial losses. In conclusion, the findings from this study have broader implications for financial institutions, offering a robust approach to risk assessment beyond the Lend-ingClub dataset.

Financial fraud poses a severe threat to the integrity of corporate financial statements and market efficiency. While auditors play a crucial role in detecting and preventing such fraud, the unique characteristics of this domain, including class imbalance, high misclassification costs, and am-biguous attributes, pose significant challenges. Traditional classification algorithms may not be optimally suited for this task. This paper proposes a novel stacking ensemble learning approach to enhanced detecting of Financial Statement Scam. By combining the strengths of multiple base learners, including Random Forest, XGBoost, and Gradient Boosting Decision Trees, our model leverages their diverse predictions to improve overall performance. A Logistic Regression me-ta-learner is employed to integrate the outputs of the base learners, capturing their collective wisdom while mitigating individual weaknesses. Extensive experimentation using a real-world dataset shown the superiority of our approach, achieving remarkable recall, precision, accuracy, and area under the curve metrics. The proposed model outperforms individual base learners, under-scoring the efficacy of ensemble learning in tackling the intricate problem of financial fraud detection. This research contributes to the creation of substantial and robust fraud detection systems, fostering trust and transparency in financial markets.

In the era of digital advancements, the escalation of credit card fraud necessitates the development of robust and efficient fraud detection systems. This paper delves into the application of machine learning models, specifically focusing on ensemble methods, to enhance credit card fraud detection. Through an extensive review of existing literature, we identified limitations in current fraud detection technologies, including issues like data imbalance, concept drift, false positives/negatives, limited generalisability, and challenges in real-time processing. To address some of these shortcomings, we propose a novel ensemble model that integrates a Support Vector Machine (SVM), K-Nearest Neighbor (KNN), Random Forest (RF), Bagging, and Boosting classifiers. This ensemble model tackles the dataset imbalance problem associated with most credit card datasets by implementing under-sampling and the Synthetic Over-sampling Technique (SMOTE) on some machine learning algorithms. The evaluation of the model utilises a dataset comprising transaction records from European credit card holders, providing a realistic scenario for assessment. The methodology of the proposed model encompasses data pre-processing, feature engineering, model selection, and evaluation, with Google Colab computational capabilities facilitating efficient model training and testing. Comparative analysis between the proposed ensemble model, traditional machine learning methods, and individual classifiers reveals the superior performance of the ensemble in mitigating challenges associated with credit card fraud detection. Across accuracy, precision, recall, and F1-score metrics, the ensemble outperforms existing models. This paper underscores the efficacy of ensemble methods as a valuable tool in the battle against fraudulent transactions. The findings presented lay the groundwork for future advancements in the development of more resilient and adaptive fraud detection systems, crucial as credit card fraud techniques continue to evolve.

Due to the recent trend of unmanned economy, retail stores have gradually reduced their service and cashier manpower. The retail product recognition becomes one of key issues for unmanned shopping. Although the success of deep neural networks has made object recognition feasible in a variety of applications, it still struggles to perform well on a large number of classes of retail products. In this paper, we propose an improved ensemble learning-based approach for retail product recognition. In the proposed approach, the object classification network is first improved through feature extraction and block attention. An ensemble model is then built by integrating multiple network models and using loss selection as model weights. In the experiments, the feasibility of our ensemble learning-based approach has been evaluated through many production items. The results demonstrate the effectiveness of the proposed approach compared with previous retail product recognition methods.

Many quantum devices signals are proportional to the number of the participating atoms that take part in the detection devices. Among these are optical magnetometers, atomic clocks, and atoms interferometers. One way to enhance the signal to noise ratio is to introduce atoms entanglement that increases the signal in a super-radiant like effect. An initial novel experiment to test the realization of atoms correlation is described here. A Cs optical magnetometer is used as a tool to test the operation of a cell-in-cavity laser and its characteristics. A vapor cell is inserted in-to an elongated external cavity of the pump laser in Littrow configuration. Higher atom polarization and reduced laser linewidth are obtained leading to better magnetometer sensitivity and signal-to-noise ratio. The Larmor frequency changes of the Free Induction Decay of optically pumped Cs atomic polarization in ambient earth magnetic field at room temperature is measured. Temporal changes in the magnetic field of less than 10 pT/Hz are measured. The first order dependence of the magnetic field on temperature and temperature gradients is eliminated, important in many practical applications. Single and gradiometric magnetometer con-figurations are presented.

Energy demand forecasting is a fundamental aspect of modern energy management. It impacts resource planning, economic stability, environmental sustainability, and energy security. This importance is making it critical for countries worldwide, particularly in cases like Türkiye, where the energy dependency ratio is notably high. The goal of this study is to propose ensemble machine learning methods such as boosting, bagging, blending, and stacking with hyperparameter tuning and k-fold cross-validation, and investigate the application of these methods for predicting Türkiye's energy demand. This study utilizes population, GDP per capita, imports and exports as input parameters based on historical data from 1979 to 2021 in Türkiye. Eleven combinations of all predictor variables were analyzed, and the best one was selected. It was observed that a very high correlation exists among population, GDP, imports, exports, and energy demand. In the first phase, the preliminary performance was investigated of 19 different machine learning algorithms using 5-fold cross-validation and measured their performance using five different metrics: MSE, RMSE, MAE, R-squared, and MAPE. Secondly, ensemble models were constructed by utilizing individual machine learning algorithms, and the performance of these ensemble models was compared with both each other and the best-performing individual machine learning algorithm. The analysis of the results revealed that placing Ridge as the meta-learner and using ET, RF and Ridge as the base learners in the stacking ensemble model produced superior results compared to the other models across performance metrics. It is anticipated that the findings of this research can be applied globally and prove valuable for energy policy planning in any country. The results obtained not only highlight the accuracy and effectiveness of our predictive model but also underscore the broader implications of this study within the framework of the United Nations' Sustainable Development Goals (SDGs).

This paper presents a study of an automated system for identifying planktic foraminifera at the species level. The system uses a combination of deep learning methods, specifically Convolutional Neural Networks (CNNs), to analyze digital images of foraminifera taken at different illumination angles. The dataset is composed of 1437 groups of sixteen grayscale images, one group for each foraminifer, that are then converted to RGB images with various processing methods. These RGB images are fed into a set of CNNs, organized in an Ensemble Learning (EL) environment. The ensemble is built by training different networks using different approaches for creating the RGB images. The study finds that an ensemble of CNN models trained on different RGB images improves the system's performance compared to other state-of-the-art approaches. The proposed system was also found to outperform human experts in classification accuracy.

Talbot effect is a self-imaging or lensless imaging phenomenon of a periodic grating illuminated by a collimated light beam at regular distances from the grating. Research on the Talbot effect has recently made significant strides thanks to the quick development of optical superlattices. The emergence of various applications of this effect in fields such as optics, acoustics, X-ray, plasmonics, and information processing has led to the increasing importance of obtaining a Talbot carpet with the use of different structures. In this paper, we investigate the Talbot effect that originates from the tunneling effect between an ensemble of vertically coupled cylindrical quantum dots (QDs). The Talbot carpet can be manipulated by changing the parameters of the QD system. In the current paper, two modified Pöschl-Teller potentials were used to model the QDs ensemble. The exciton’s lifetime and tunneling time’s dependence on the first QD’s potential half-width is found for a fixed value of the external electric field. The nonlinear changes in the refractive index and absorption spectrum dependent on the tunneling effect are obtained. Afterward, the Talbot carpet formation is investigated, particularly the dependences of the formed periodic wavefront’s visibility on medium length, coupling field’s strength, and tunneling parameter. Finally, we have observed the intensity distribution of the diffraction field at Talbot half-distance.

Ransomware is one of the most dangerous types of malware, which is frequently intended to spread through a network to damage the designated client by encrypting the client’s vulnerable data. Conventional signature-based ransomware detection technique falls behind because it can only detect known anomalies. When it comes to new and non-familiar ransomware traditional system unveils huge shortcomings. For detecting unknown patterns and sorts of new ransomware families,behavior-based anomaly detection approaches are likely to be the most efficient approach. In the wake of this alarming condition, this paper presents an ensemble classification model consisting of three widely used machine learning techniques that include Decision Tree (DT), RandomForest (RF), and K-nearest neighbor (KNN). To achieve the best outcome ensemble soft voting and hard voting techniques are used while classifying ransomware families based on attack attributes. Performance analysis is done by comparing our proposed ensemble models with standalone models on behavioral attributes based ransomware dataset..

The relative operating characteristic (ROC) curve is a popular diagnostic tool in forecast verification, with the area under the ROC curve (AUC) used as a verification metric measuring the discrimination ability of a forecast. Along with calibration, discrimination is deemed as a fundamental probabilistic forecast attribute. In particular, in ensemble forecast verification, AUC provides a basis for the comparison of potential predictive skill of competing forecasts. While this approach is straightforward when dealing with forecasts of common events (e.g. probability of precipitation), the AUC interpretation can turn out to be oversimplistic or misleading when focusing on rare events (e.g. precipitation exceeding some warning criterion). How should we interpret AUC of ensemble forecasts when focusing on rare events? How can changes in the way probability forecasts are derived from the ensemble forecast affect AUC results? How can we detect a genuine improvement in terms of predictive skill? Based on verification experiments, a critical eye is cast on the AUC interpretation to answer these questions. As well as the traditional trapezoidal approximation and the well-known bi-normal fitting model, we discuss a new approach which embraces the concept of imprecise probabilities and relies on the subdivision of the lowest ensemble probability category.

While the use of crime data has been widely advocated in the literature, its availability is often limited to large urban cities and isolated databases tend not to allow for spatial comparisons. This paper presents an efficient machine learning framework capable of predicting spatial crime occurrences, without using past crime as a predictor, and at a relatively high resolution: the U.S. Census Block Group level. The proposed framework is based on an in-depth multidisciplinary literature review allowing the selection of 188 best-fit crime predictors from socio-economic, demographic, spatial, and environmental data. Such data are published periodically for the entire United States. The selection of the appropriate predictive model was made through a comparative study of different machine learning families of algorithms, including generalized linear models, deep learning, and ensemble learning. The gradient boosting model was found to yield the most accurate predictions for violent crimes, property crimes, motor vehicle thefts, vandalism, and the total count of crimes. Extensive experiments on real-world datasets of crimes reported in 11 U.S. cities demonstrated that the proposed framework achieves an accuracy of 73 and 77% when predicting property crimes and violent crimes, respectively.

We address weighted composition operators between Bers-type spaces on generalized Hua-Cartan-Hartogs domains and provide necessary and sufficient conditions for their boundedness and compactness. We then apply our results to study the boundedness and the compactness of weighted composition operators between Bers-type spaces on five different domains: generalized Hua domains, Cartan-Hartogs domains, generalized Cartan-Hartogs domains, generalized Cartan-Hartogs domains over different Cartan domains and generalized ellipsoidal-type domains.

In recent years, researches on combining wavelet decomposition and convolutional neural network (CNN) together to classify hyperspectral images (HSI) have emerged, and some effective classification models have been proposed and achieved good classification results. However, there are two problems for most of the proposed models. One is the heavy training parameters and the other is that there is no distinction between the classification effectiveness of low frequency and high frequency features after wavelet decomposition. In this paper, a new light-weighted HSI classification model (LLFWCNN) is proposed, which performs multi-layer wavelet decomposition for HSI after dimensionality reduction, and only arranges the low frequency features in a specific stack mode, then classifies them through a well-designed convolutional neural network. Compared with other classification models, the number of parameters is only 2.5% of that of other models. And only the low frequency features after wavelet decomposition are used, while the high frequency features are abandoned. The results showed that compared with the state-of-the-art classification models, LLFWCNN could obtain the same or even better classification results with fewer network parameters and proved that the low frequency features after wavelet decomposition provide LLFWCNN with more favorable information for HSI classification as well.

In the literature, estimation of weighted extropy are least considered. In this paper some non parametric estimators of weighted extropy are given. The validation and comparison of the estimators are implemented with the help of simulation study and data illustration. The usefulness of the estimators are demonstrated using real data sets.

There has been considerable research on reconstructing 3D shapes from single-view images; however, preserving the detailed information of the input image remains difficult. In this paper, we propose the application of a gradient map to train a network, aimed at improving the visual quality of fine-grained details such as the thin and tiny components of generated shapes. Each gradient map was created from the original voxel data, and each value represented the amount of information per volume. Here, the gradient map was defined by several methods that mathematically quantify and represent the detailed structure of an object. By applying this map to the loss function in training, we could induce the network to intensively train partial details, such as thin and narrow parts. We demonstrated that the detailed information was well-recovered when a weight that is proportional to the gradient value was applied to the loss. Furthermore, it is expected that our method will contribute to the development of 3D technologies related to the construction of virtual space for simulation and new customer experience.

In this paper we present an efficient technique for the synthesis of very large sparse arrays, with arbitrary circularly symmetrical upper bounds for the pattern specifications. The algorithm, that is based on iterative smooth re-weighted L1 minimizations is very flexible, and is capable of achieving very good performances with respect to competitive algorithms. Furthermore, thanks to its efficiency, planar arrays of hundreds of wavelengths can be synthesized with limited computational effort.

Automated medical diagnosis is one of the important machine learning applications in the domain of healthcare. In this regard, most of the approaches primarily focus on optimizing the accuracy of classification models. In this research, we argue that unlike general-purpose classification problems, medical applications, such as chronic kidney disease (CKD) diagnosis, require special treatment. In the case of CKD, apart from model performance, other factors such as the cost of data acquisition may also be taken into account to enhance the applicability of the automated diagnosis system. In this research, we have proposed two techniques for cost-sensitive feature ranking. An ensemble of decision tree models is employed in both the techniques for computing the worth of a feature in the CKD dataset. An automatic threshold selection heuristic is also introduced which is based on the intersection of features’ worth and their accumulated cost. A set of experiments are conducted to evaluate the efficacy of the proposed techniques on both tree-based and non-tree based classification models. The proposed approaches are also evaluated against several comparative techniques. Furthermore, it is demonstrated that the proposed techniques select around 1/4^th of the original CKD features while reducing the cost by a factor of 7.42 of the original feature set. Based on the extensive experimentation it is concluded that the proposed techniques employing feature-cost interaction heuristic tend to select feature subsets that are both useful and cost-effective.

Recreational and leisure areas play a special role. These areas mitigate or eliminate the disadvantages of living in large cities, and they enhance the quality of life in small towns. The aim of this study was to analyze the share of recreational and leisure areas in Polish counties in 2022. In Poland, recreational and leisure areas constitute a separate land-use category in cadastral registers. Annual cadastral data from the Land and Building Register at county level (in tabular form) were the main source of data for the study. The analysis revealed that the share of recreational and leisure areas was higher in counties situated in western and south-western Poland, as well as in cities. The spatially varied influence of socioeconomic factors on the share of recreational and leisure areas in Polish counties in 2002 was determined with the use of local Moran's I statistic and geographically weighted regression (GWR). The study confirmed that population density was significantly related to the share of recreational and leisure areas in Polish counties. The impact of the remaining socioeconomic factors associated with spatial and economic development varied across regions. The study also revealed that in addition to the current socioeconomic determinants, the share of recreational and leisure areas in Polish counties was also influenced by historical factors and the counties' development since their establishment.

The Covid19 pandemic and the current wars in some countries have put incredible pressures on the global economy. Challenges for the U.S. include not only economic factors, major disruptions and reorganizations of the supply chains, but also those of national security and global geopolitics. This unprecedented situation makes predicting economic crisis for the coming years crucial yet challenging. In this paper, we propose a method based on various machine-learning models to predict the probability of a recession for the US economy in the next year. We collect the U.S’ monthly macroeconomics indicators and recession data from January of 1983 to December of 2023 to predict the probability of an economic recession in 2024. The performance of the individual economics indicator for the coming year was predicted separately, and then all of the the predicted indicators were used to forecast a possible economic recession. Our results showed that the U.S. will face a high probability of being in a recession period in the last quarter of 2024.

The World Health Organization (WHO) has released reports indicating that heart disorders hold the unfortunate distinction of being the primary cause of death worldwide. Shockingly, an astonishing estimated 17.9 million lives are claimed by heart diseases annually, accounting for an alarming 31% of all global deaths. With all the flaws in the clinical situation, it is frequently challenging to assess the severity of cardiac disease and forecast its course of progression due to heterogeneity and complex interplay of factors. Therefore, early heart disease detection is essential for effective therapy. To address these challenges, Machine Learning (ML) boosting algorithms play a pivotal role as the main components of predictive analytics required to do this. The main objective of this study is to develop a comprehensive comparative framework to predict heart diseases using state-of-the-art machine learning with boosting techniques such as Decision Tree, Random Forest, Gradient Boosting, Catboost, XGboost, Light GBM, and Adaboost. To evaluate the performance of the models, a large heart disorders dataset is used from the UCI machine learning repository, comprised of 26 feature-based numerical and categorical attributes with 8763 samples from all over the globe. The Experimental results reveal that AdaBoost attained the highest accuracy of 95% and outperforms other algorithms concerning various performance measures like precision= 0.98, recall= 0.95, specificity= 0.95, f1-score=0.01, Negative predicted value= 0.83, False positive rate= 0.04, False negative rate= 0.04 and False Development rate= 0.01.

Deepfakes are manipulated or altered images, or video, that are created using deep learning models with high levels of photorealism. The two popular methods of producing a deepfake are based on either convolutional neural networks (CNN), or autoencoders. Deepfakes created using CNN comparatively show higher qualities of realism, yet oftentimes leave artifacts and distortions in the generated media that can be detected using machine learning and deep learning algorithms. In recent years, there has been an influx of periocular image and video data because of the increase usage of face masks. By wearing masks, much of what is used for facial recognition is hidden, leaving only the periocular region visible to an observer. This loss of vital information leads to easier misidentification of media, allowing deepfakes to less likely be identified as fake. In this work, feature extraction methods, such as Scale-Invariant Feature Transform (SIFT), Histogram of Oriented Gradients (HOG), and CNN, are used to train an ensemble deep learning model to detect deepfakes in videos on a frame-by-frame level based on the periocular region. Our proposed model is able to distinguish original and manipulated images with accuracies around 98.9 percent, which is an improvement to previous works by combining SIFT and HOG for deepfake detection in convolutional neural networks.

Increasingly measured data in the context of smart cities can be used to develop new and innovative business models to increase efficiency and the value of life. A time-series classification algorithm can support to automatize many different processes such as forecasting services. In order to ensure data security and privacy, Federated Learning trains a global model collaboratively on multiple clients. Having different data-distributions and data-quantities across participating clients, neural networks suffer from slow convergence and overfitting. Based on different data-distributions, data-quantities and number of clients, we develop and evaluate different data-clustering strategies to update global model weights in comparison to the state of the art. We use public time-series data, generate various synthetic datasets and train a Relational-Regularized Autoencoder for classification purposes. Our results show an improvement of model performance concerning generalization.

Ensembles of Species Distribution Models (SDMs) represent the geographic ranges of pathogen vectors by combining alternative analytical approaches and merging information on vector occurrences with more extensive environmental data. Biased collection data impact SDMs, regardless of the target species but no studies have compared the differences in the distributions predicted by the ensemble models when different sampling frameworks are used for the same species. We compared Ensemble SDMs for two important Ixodid tick vectors, Amblyomma americanum and Ixodes scapularis in mainland Florida, USA, when inputs were either convenience samples of ticks, or collections obtained using the standard protocols promulgated by the U.S. Centers for Disease Control and Prevention. The Ensemble SDMs for the convenience samples and standard surveys showed only a slight agreement (Kappa = 0.060, A. americanum; 0.053, I. scapularis). Convenience sample SDMs indicated A. americanum and I. scapularis should be absent from 34.5% and 30.9% of the state where standard surveys predicted the highest likelihood of occurrence of the respective vectors. Ensemble models from standard surveys predicted 81.4% and 72.5% (A. americanum and I. scapularis) of convenience sample sites. Omission errors by standard survey SDMs, of the convenience collections, frequently were associated with adjacency to at least one SDM or errors in geocoding algorithms that failed to correctly locate convenience samples. These geocoding errors emphasize commonly overlooked needs to explicitly evaluate and improve data quality for vector survey data used in spatial models.

Capability assessment plays a crucial role in the demonstration and construction of equipment. To improve the accuracy and stability of capability assessment, we study the neural network learning algorithms in the field of capability assessment and index sensitivity. Aiming at the problem of over-fitting and parameter optimization in neural network learning, the paper proposes an improved machine learning algorithm—the Ensemble Learning Based on Policy Optimization Neural Networks (ELPONN) algorithm with the policy optimization and ensemble learning. This algorithm presents optimized neural network learning algorithm through different strategies evolution, and builds an ensemble learning model of multi-intelligent algorithms to assessment the capability and analyze the sensitivity of the indexes. Through the assessment of capabilities, the algorithm effectively avoids parameter optimization from entering the minimum point in performance to improve the accuracy of equipment capability assessment, which is significantly better than previous neural network assessment methods. The experimental results show that the mean relative error is 4.10%, which is better than BP, GABP, and early stopping. The ELPONN algorithm has better accuracy and stability performance, and meets the requirements of capability assessment.

Financial statements depict the condition of a company and need to be analyzed and evaluated to assess its performance. This research aims to analyze financial statements to describe the financial condition, measure business development over time, and evaluate the achievement of the com-pany's objectives. An optimization analysis of financial ratios is performed using the Weighted Goal Programming (WGP) model, which addresses multiple objectives by applying weights based on their priorities. The Analytical Hierarchy Process was used to determine the priority weights of deviation variables from each financial ratio target. Financial ratios were selected based on their impact on profit using factor analysis. The constructed WGP model aims to minimize deviations in Return on Assets, Operating Ratios, Operating Income Ratio, Total Assets Turnover, and Current Ratio. Computational calculations to solve the WGP model are per-formed using Python, with pseudocode provided. A case study on a company in the garment and textile sector was conducted and found that the Operating Ratio, Return on Assets, Operating Income Ratio, and Current Ratio still need improvement by developing strategies to achieve the targets. Sensitivity analysis was also employed to assess the resilience of the model in response to alterations in data.

This article presents a detailed examination of the methodology and modeling tools utilized to analyze gas flow in pipelines, rooted in the fundamental principles of gas dynamics. The methodology integrates numerical simulations with modern neural network techniques, particularly focusing on the Physics-Informed Neural Network (PINN) method. This innovative approach combines artificial neural networks (ANNs) with physical equations, offering a more efficient and accurate way to model various complex processes and phenomena. The proposed mathematical model, based on the Euler equation, has been meticulously implemented using the Python language. Verification with analytical solutions ensures the accuracy and reliability of the computations. In the research, a comprehensive comparative analysis was conducted between results obtained using the PINN method and those from conventional Computational Fluid Dynamics (CFD) approaches. The analysis highlighted the advantages of the PINN method, which produced smoother pressure and velocity fluctuation profiles while reducing computation time, demonstrating its potential as a transformative modeling tool. The data derived from this study are of paramount importance for ensuring ongoing energy supply reliability and can also be used to create predictive models related to gas behavior in pipelines. The application of modeling techniques for gas flow simulation has the potential to revolutionize the integrity of our energy infrastructure and utilization of gas resources. However, it is crucial to emphasize that the effectiveness of such models relies on continuous monitoring and frequent updates to ensure alignment with real-world conditions. This research not only contributes to a deeper understanding of compressible gas flows but also underscores the crucial role of advanced modeling methodologies in the sustainable management of gas resources for both current and future generations.