Search

Roller bearings are critical components in various mechanical systems, and the timely detection of potential failures is essential for preventing costly downtimes and avoiding substantial machinery breakdown. This research focuses on finding and verifying a robust method that can detect failures early, without creating false positive failure states. Therefore, this paper introduces a novel algorithm for the early detection of roller bearing failures, particularly tailored to high-precision bearings and automotive test bed systems. The featured method (AFI—Advanced Failure Indicator) utilizes the Fast Fourier Transform (FFT) of wideband accelerometers to calculate the spectral content of vibration signals emitted by roller bearings. By calculating the frequency bands and tracking the movement of these bands within the spectra, the method provides an indicator of the machinery's health, mainly focusing on the early stages of bearing failure. The calculated channel can be used as a trend indicator, enabling the method to identify subtle deviations associated with impending failures. The AFI algorithm incorporates a non-static limit through moving average calculations and volatility analysis methods to determine critical changes in the signal. This thresholding mechanism ensures the algorithm's responsiveness to variations in operating conditions and environmental factors, contributing to its robustness in diverse industrial settings. Further refinement was achieved through an outlier detection filter, which reduces false positives and enhances the algorithm's accuracy in identifying genuine deviations from the normal operational state. To benchmark the developed algorithm, it was compared with three industry-standard algorithms: VRMS calculations per ISO 10813-3, Mean Absolute Value of Extremums (MAVE), and Envelope Frequency Band (EFB). This comparative analysis aimed to evaluate the efficacy of the novel algorithm against the established methods in the field, providing valuable insights into its potential advantages and limitations. In summary, this paper presents an innovative algorithm for the early detection of roller bearing failures, leveraging FFT-based spectral analysis, trend monitoring, adaptive thresholding, and outlier detection. Its ability to confirm the first failure state underscores the algorithm's effectiveness. [ABSTRACT FROM AUTHOR]

In recent years, there has been extensive research and application of unsupervised monocular depth estimation methods for intelligent vehicles. However, a major limitation of most existing approaches is their inability to predict absolute depth values in physical units, as they generally suffer from the scale problem. Furthermore, most research efforts have focused on ground vehicles, neglecting the potential application of these methods to unmanned aerial vehicles (UAVs). To address these gaps, this paper proposes a novel absolute depth estimation method specifically designed for flight scenes using a monocular vision sensor, in which a geometry-based scale recovery algorithm serves as a post-processing stage of relative depth estimation results with scale consistency. By exploiting the feature correspondence between successive images and using the pose data provided by equipped navigation sensors, the scale factor between relative and absolute scales is calculated according to a multi-view geometry model, and then absolute depth maps are generated by pixel-wise multiplication of relative depth maps with the scale factor. As a result, the unsupervised monocular depth estimation technology is extended from relative depth estimation in semi-structured scenes to absolute depth estimation in unstructured scenes. Experiments on the publicly available Mid-Air dataset and customized data demonstrate the effectiveness of our method in different cases and settings, as well as its robustness to navigation sensor noise. The proposed method only requires UAVs to be equipped with monocular camera and common navigation sensors, and the obtained absolute depth information can be directly used for downstream tasks, which is significant for this kind of vehicle that has rarely been explored in previous depth estimation studies. [ABSTRACT FROM AUTHOR]

In this paper, we propose a modified spectral conjugate gradient (MSCG) method for solving absolute value equations associated with second-order cones (SOCAVEs). Some properties of the SOCAVEs are analyzed, and the global convergence of the MSCG method is discussed in depth. Numerical experiments are given to illustrate the effectiveness and competitiveness of our algorithm. [ABSTRACT FROM AUTHOR]

Positive and unlabeled learning (PU learning) is a significant binary classification task in machine learning; it focuses on training accurate classifiers using positive data and unlabeled data. Most of the works in this area are based on a two-step strategy: the first step is to identify reliable negative examples from unlabeled examples, and the second step is to construct the classifiers based on the positive examples and the identified reliable negative examples using supervised learning methods. However, these methods always underutilize the remaining unlabeled data, which limits the performance of PU learning. Furthermore, many methods require the iterative solution of the formulated quadratic programming problems to obtain the final classifier, resulting in a large computational cost. In this paper, we propose a new method called the absolute value inequality support vector machine, which applies the concept of eccentricity to select reliable negative examples from unlabeled data and then constructs a classifier based on the positive examples, the selected negative examples, and the remaining unlabeled data. In addition, we apply a hyperparameter optimization technique to automatically search and select the optimal parameter values in the proposed algorithm. Numerical experimental results on ten real-world datasets demonstrate that our method is better than the other three benchmark algorithms. [ABSTRACT FROM AUTHOR]

Graph polynomials is one of the important research directions in mathematical chemistry. The coefficients of some graph polynomials, such as matching polynomial and permanental polynomial, are related to structural properties of graphs. The Hosoya index of a graph is the sum of the absolute value of all coefficients for the matching polynomial. And the permanental sum of a graph is the sum of the absolute value of all coefficients of the permanental polynomial. In this paper, we characterize the second to sixth minimal Hosoya indices of all bicyclic graphs. Furthermore, using the results, the second to sixth minimal permanental sums of all bicyclic graphs are also characterized. [ABSTRACT FROM AUTHOR]

The leakage flow has a significant impact on the aerodynamic losses and efficiency of the compressor. This paper investigates the loss mechanism in the tip region based on a high-load cantilevered stator cascade. Firstly, a high-fidelity flow field structure was obtained based on the Enhanced Delay Detached Eddy Simulation (EDDES) method. Subsequently, the Liutex method was employed to study the vortex structures in the tip region. The results indicate the presence of a tip leakage vortex (TLV), passage vortex (PV), and induced vortex (IV) in the tip region. At i = 4 ° , 8 ° , the induced vortex interacts with the PV and low-energy fluid, forming a "three-shape" mixed vortex. Finally, a qualitative and quantitative analysis of the loss sources in the tip flow field was conducted based on the entropy generation rate, and the impact of the incidence on the losses was explored. The loss sources in the tip flow field included endwall loss, blade profile loss, wake loss, and secondary flow loss. At i = 0 ° , the loss primarily originated from the endwall and blade profile, accounting for 40 % and 39 % , respectively. As the incidence increased, the absolute value of losses increased, and the proportion of loss caused by secondary flow significantly increased. At i = 8 ° , the proportion of secondary flow loss reached 47%, indicating the most significant impact. [ABSTRACT FROM AUTHOR]

In this paper, we construct a new class of convex functions, so-called generalized n-polynomial p-convex functions. We investigate their algebraic properties and provide some relationships between these functions and other types of convex functions. We establish Hermite–Hadamard (H–H) inequality for the newly defined class of functions. Additionally, we derive refinements of H–H inequality for functions whose first derivatives in absolute value at certain power are generalized n-polynomial p-convex. When p = − 1 , our definition evolves into a new definition for the class of convex functions so-called generalized n-polynomial harmonically convex functions. The results obtained in this study generalize regarding those found in the existing literature. By extending these particular types of inequalities, the objective is to unveil fresh mathematical perspectives, attributes and connections that can enhance the evolution of more resilient mathematical methodologies. This study aids in the progression of mathematical instruments across diverse scientific fields. [ABSTRACT FROM AUTHOR]

The purpose of the paper is to present new q-parametrized Hermite–Hadamard-like type integral inequalities for functions whose third quantum derivatives in absolute values are s-convex and  (α , m) -convex, respectively. Two new q-integral identities are presented for three time q-differentiable functions. These lemmas are used like basic elements in our proofs, along with several important tools like q-power mean inequality, and q-Holder's inequality. In a special case, a non-trivial example is considered for a specific parameter and this case illustrates the investigated results. We make links between these findings and several previous discoveries from the literature. [ABSTRACT FROM AUTHOR]