Effect of Bath pH on the Squareness of Electroless CoNiWP Magnetic Films

Electroless CoNiWP magnetic films were prepared by varying the bath pH and then characterized by energy dispersive X-ray analysis, X-ray diffraction and magnetic force microscopy, it has been found that the microstructure and the magnetic properties of films were influenced greatly by the bath pH. At the bath pH 8.06, the grain size and coercivity of the films reach maximuml while the squareness （Mr/Ms） of MH curves reaches minimum. The Henkel plots indicates that the exchange-coupling interaction is very weak at this pH, which may be caused by phase-separation and large grain size, and then results in the lowest squareness. At pH above 8.5, obvious exchange-coupling interaction is observed because of the inexistence of phase-separation and the refinement of grain size.

Factors Affecting the Squareness of Hysteresis Loops of Sintered NdFeB Magnets

Investigation into the magnets with different squareness of hysteresis loop(SHL) reveals that the microstructure of sintered NdFeB magnets has great effects on the SHL of the magnets. The abnormal grain growth deteriorates the SHL seriously. The shape of the grain and the grain boundary affect the intensity of demagnetization field, and consequently on the SHL. The added elements have effects on the phase structures and distributions in the magnets, which influences the uniform of demagnetization field.

融合IMR-WGAN的时序数据修复方法

工业数据由于技术故障和人为因素通常导致数据异常,现有基于约束的方法因约束阈值设置的过于宽松或严格会导致修复错误,基于统计的方法因平滑修复机制导致对时间步长较远的异常值修复准确度较低.针对上述问题,提出了基于奖励机制的最小迭代修复和改进WGAN混合模型的时序数据修复方法.首先,在预处理阶段,保留异常数据,进行信息标注等处理,从而充分挖掘异常值与真实值之间的特征约束.其次,在噪声模块提出了近邻参数裁剪规则,用于修正最小迭代修复公式生成的噪声向量.将其传递至模拟分布模块的生成器中,同时设计了一个动态时间注意力网络层,用于提取时序特征权重并与门控循环单元串联组合捕捉不同步长的特征依赖,并引入递归多步预测原理共同提升模型的表达能力;在判别器中设计了Abnormal and Truth奖励机制和Weighted Mean Square Error损失函数共同反向优化生成器修复数据的细节和质量.最后,在公开数据集和真实数据集上的实验结果表明,该方法的修复准确度与模型稳定性显著优于现有方法.

Sensitivity of coercivity and squareness factor of a Nd-Fe-B sintered magnet on post-sintering annealing temperature

An N38SH-grade magnet with low oxygen content was used to study the evolution of magnetic properties upon post-sin-tering annealing. Phase transformation of as-sintered magnet was investigated by differential scanning calorimetry （DSC）. Three low temperature eutectic transition points were detected. Little change could be found when annealed below the lowest eutectic transition point. A wide annealing temperature range （460–560 oC） between the lowest and highest eutectic transition point was available for this magnet to achieve a relatively high coercivity （~1671 kA/m） at a relatively low Dy content （~3 wt.%）. However, squareness fac-tor （SF） of the demagnetizing curve and its temperature stability were found to decrease after annealing above the highest eutectic transition point. This was attributed to the change of Cu content in the Nd-rich phase under different annealing temperatures.

Grain boundary optimization induced substantial squareness enhancement and high performance in iron-rich Sm-Co-Fe-Cu-Zr magnets

Increasing iron content has been witnessed an essential method to improve the remanence of 2:17-type Sm-Co-Fe-Cu-Zr magnets,however,the inferior squareness factor accompanied with the increased iron content turns into a neck sticking problem.In this work,the grain boundary optimization induced substantial squareness enhancement from 63.4%to 91.4%,and consequently an excellent maximum energy product of 32.63 MGOe have been achieved in iron-rich Sm-Co-Fe-Cu-Zr magnets via tuning solution process.It is clearly revealed that the grain boundary(GB)phases as well as the micro-twins’density in grain interiors can be controlled and interprets the enhancement mechanism of squareness.

Natural Convection and Irreversibility of Nanofluid Due to Inclined Magnetohydrodynamics(MHD)Filled in a Cavity with Y-Shape Heated Fin:FEM Computational

This study explains the entropy process of natural convective heating in the nanofluid-saturated cavity in a heated fin andmagnetic field.The temperature is constant on the Y-shaped fin,insulating the topwall while the remaining walls remain cold.All walls are subject to impermeability and non-slip conditions.The mathematical modeling of the problem is demonstrated by the continuity,momentum,and energy equations incorporating the inclined magnetic field.For elucidating the flow characteristics Finite ElementMethod(FEM)is implemented using stable FE pair.A hybrid fine mesh is used for discretizing the domain.Velocity and thermal plots concerning parameters are drawn.In addition,a detailed discussion regarding generation energy by monitoring changes in magnetic,viscous,total,and thermal irreversibility is provided.In addition,line graphs are created for the u and v components of the velocity profile to predict the flow behavior.Current simulations assume the dimensionless representative of magnetic field Hartmann number Ha between 0 and 100 and a magnetic field inclination between 0 and 90 degrees.A constant 4% volume proportion of nanoparticles is employed throughout all scenarios.

A Novel Fractional Dengue Transmission Model in the Presence of Wolbachia Using Stochastic Based Artificial Neural Network

The purpose of this research work is to investigate the numerical solutions of the fractional dengue transmission model(FDTM)in the presence of Wolbachia using the stochastic-based Levenberg-Marquardt neural network(LM-NN)technique.The fractional dengue transmission model(FDTM)consists of 12 compartments.The human population is divided into four compartments;susceptible humans(S_(h)),exposed humans(E_(h)),infectious humans(I_(h)),and recovered humans(R_(h)).Wolbachia-infected and Wolbachia-uninfected mosquito population is also divided into four compartments:aquatic(eggs,larvae,pupae),susceptible,exposed,and infectious.We investigated three different cases of vertical transmission probability(η),namely when Wolbachia-free mosquitoes persist only(η=0.6),when both types of mosquitoes persist(η=0.8),and when Wolbachia-carrying mosquitoes persist only(η=1).The objective of this study is to investigate the effectiveness of Wolbachia in reducing dengue and presenting the numerical results by using the stochastic structure LM-NN approach with 10 hidden layers of neurons for three different cases of the fractional order derivatives(α=0.4,0.6,0.8).LM-NN approach includes a training,validation,and testing procedure to minimize the mean square error(MSE)values using the reference dataset(obtained by solving the model using the Adams-Bashforth-Moulton method(ABM).The distribution of data is 80% data for training,10% for validation,and,10% for testing purpose)results.A comprehensive investigation is accessible to observe the competence,precision,capacity,and efficiency of the suggested LM-NN approach by executing the MSE,state transitions findings,and regression analysis.The effectiveness of the LM-NN approach for solving the FDTM is demonstrated by the overlap of the findings with trustworthy measures,which achieves a precision of up to 10^(-4).

Algorithms and statistical analysis for linear structured weighted total least squares problem

Weighted total least squares(WTLS)have been regarded as the standard tool for the errors-in-variables(EIV)model in which all the elements in the observation vector and the coefficient matrix are contaminated with random errors.However,in many geodetic applications,some elements are error-free and some random observations appear repeatedly in different positions in the augmented coefficient matrix.It is called the linear structured EIV(LSEIV)model.Two kinds of methods are proposed for the LSEIV model from functional and stochastic modifications.On the one hand,the functional part of the LSEIV model is modified into the errors-in-observations(EIO)model.On the other hand,the stochastic model is modified by applying the Moore-Penrose inverse of the cofactor matrix.The algorithms are derived through the Lagrange multipliers method and linear approximation.The estimation principles and iterative formula of the parameters are proven to be consistent.The first-order approximate variance-covariance matrix(VCM)of the parameters is also derived.A numerical example is given to compare the performances of our proposed three algorithms with the STLS approach.Afterwards,the least squares(LS),total least squares(TLS)and linear structured weighted total least squares(LSWTLS)solutions are compared and the accuracy evaluation formula is proven to be feasible and effective.Finally,the LSWTLS is applied to the field of deformation analysis,which yields a better result than the traditional LS and TLS estimations.

Characteristics of laser-induced breakdown spectroscopy of liquid slag

Rapid online analysis of liquid slag is essential for optimizing the quality and energy efficiency of steel production. To investigate the key factors that affect the online measurement of refined slag using laser-induced breakdown spectroscopy(LIBS), this study examined the effects of slag composition and temperature on the intensity and stability of the LIBS spectra. The experimental temperature was controlled at three levels: 1350℃, 1400℃, and 1450℃. The results showed that slag composition and temperature significantly affected the intensity and stability of the LIBS spectra. Increasing the Fe content and temperature in the slag reduces its viscosity, resulting in an enhanced intensity and stability of the LIBS spectra. Additionally, 42 refined slag samples were quantitatively analyzed for Fe, Si, Ca, Mg, Al, and Mn at 1350℃, 1400℃, and 1450℃.The normalized full spectrum combined with partial least squares(PLS) quantification modeling was used, using the Ca Ⅱ 317.91 nm spectral line as an internal standard. The results show that using the internal standard normalization method can significantly reduce the influence of spectral fluctuations. Meanwhile, a temperature of 1450℃ has been found to yield superior results compared to both 1350℃ and 1400℃, and it is advantageous to conduct a quantitative analysis of the slag when it is in a “water-like” state with low viscosity.

THE WEIGHTED KATO SQUARE ROOT PROBLEMOF ELLIPTIC OPERATORS HAVING A BMOANTI-SYMMETRICPART

Let n≥2 and let L be a second-order elliptic operator of divergence form with coefficients consisting of both an elliptic symmetric part and a BMO anti-symmetric part in ℝ^(n).In this article,we consider the weighted Kato square root problem for L.More precisely,we prove that the square root L^(1/2)satisfies the weighted L^(p)estimates||L^(1/2)(f)||L_(ω)^p(R^(n))≤C||■f||L_(ω)^p(R^(n);R^(n))for any p∈(1,∞)andω∈Ap(ℝ^(n))(the class of Muckenhoupt weights),and that||■f||L_(ω)^p(R^(n);R^(n))≤C||L^(1/2)(f)||L_(ω)^p(R^(n))for any p∈(1,2+ε)andω∈Ap(ℝ^(n))∩RH_(2+ε/p),(R^(n))(the class of reverse Hölder weights),whereε∈(0,∞)is a constant depending only on n and the operator L,and where(2+ε/p)'denotes the Hölder conjugate exponent of 2+ε/p.Moreover,for any given q∈(2,∞),we give a sufficient condition to obtain that||■f||L_(ω)^p(R^(n);R^(n))≤C||L^(1/2)(f)||L_(ω)^p(R^(n))for any p∈(1,q)andω∈A_(p)(R^(n))∩pRH_(q/p),(R^(n)).As an application,we prove that when the coefficient matrix A that appears in L satisfies the small BMO condition,the Riesz transform∇L^(−1/2)is bounded on L_(ω)^(p)(ℝ^(n))for any given p∈(1,∞)andω∈Ap(ℝ^(n)).Furthermore,applications to the weighted L^(2)-regularity problem with the Dirichlet or the Neumann boundary condition are also given.

Manipulator tracking technology based on FSRUKF

Aiming at the shortcoming that the traditional industrial manipulator using off-line programming cannot change along with the change of external environment,the key technologies such as machine vision and manipulator control are studied,and a complete manipulator vision tracking system is designed.Firstly,Denavit-Hartenberg(D-H)parameters method is used to construct the model of the manipulator and analyze the forward and inverse kinematics equations of the manipulator.At the same time,a binocular camera is used to obtain the threedimensional position of the target.Secondly,in order to make the manipulator track the target more accurately,the fuzzy adaptive square root unscented Kalman filter(FSRUKF)is proposed to estimate the target state.Finally,the manipulator tracking system is built by using the position-based visual servo.The simulation experiments show that FSRUKF converges faster and with less error than the square root unscented Kalman filter(SRUKF),which meets the application requirements of the manipulator tracking system,and basically meets the application requirements of the manipulator tracking system in the practical experiments.

Identification of time-varying system and energy-based optimization of adaptive control in seismically excited structure

The combination of structural health monitoring and vibration control is of great importance to provide components of smart structures.While synthetic algorithms have been proposed,adaptive control that is compatible with changing conditions still needs to be used,and time-varying systems are required to be simultaneously estimated with the application of adaptive control.In this research,the identification of structural time-varying dynamic characteristics and optimized simple adaptive control are integrated.First,reduced variations of physical parameters are estimated online using the multiple forgetting factor recursive least squares(MFRLS)method.Then,the energy from the structural vibration is simultaneously specified to optimize the control force with the identified parameters to be operational.Optimization is also performed based on the probability density function of the energy under the seismic excitation at any time.Finally,the optimal control force is obtained by the simple adaptive control(SAC)algorithm and energy coefficient.A numerical example and benchmark structure are employed to investigate the efficiency of the proposed approach.The simulation results revealed the effectiveness of the integrated online identification and optimal adaptive control in systems.

Vibration Suppression for Active Magnetic Bearings Using Adaptive Filter with Iterative Search Algorithm

Active Magnetic Bearing(AMB) is a kind of electromagnetic support that makes the rotor movement frictionless and can suppress rotor vibration by controlling the magnetic force. The most common approach to restrain the rotor vibration in AMBs is to adopt a notch filter or adaptive filter in the AMB controller. However, these methods cannot obtain the precise amplitude and phase of the compensation current. Thus, they are not so effective in terms of suppressing the vibrations of the fundamental and other harmonic orders over the whole speed range. To improve the vibration suppression performance of AMBs,an adaptive filter based on Least Mean Square(LMS) is applied to extract the vibration signals from the rotor displacement signal. An Iterative Search Algorithm(ISA) is proposed in this paper to obtain the corresponding relationship between the compensation current and vibration signals. The ISA is responsible for searching the compensating amplitude and shifting phase online for the LMS filter, enabling the AMB controller to generate the corresponding compensation force for vibration suppression. The results of ISA are recorded to suppress vibration using the Look-Up Table(LUT) in variable speed range. Comprehensive simulations and experimental validations are carried out in fixed and variable speed range, and the results demonstrate that by employing the ISA, vibrations of the fundamental and other harmonic orders are suppressed effectively.

Near Infrared Spectroscopy (NIRS) Model-Based Prediction for Protein Content in Cowpea

Cowpea (Vigna unguiculata L. Walp) is a multi-purpose legume with high quality protein for human consumption and livestock. The objective of this work was to develop near-infrared spectroscopy (NIRS) prediction models to estimate protein content in cowpea. A total of 116 cowpea breeding lines with a wide range of protein contents (19.28 % to 32.04%) were selected to build the model using whole seed and ground seed samples. Partial least-squares discriminant analysis (PLS-DA) regression technique with different pre-treatments (derivatives, standard normal variate, and multiplicative scatter correction) were carried out to develop the protein prediction model. Results showed: 1) spectral plots of both the whole seed and ground seed showed higher spectral scatter at higher wavelengths (>1450 nm), 2) data pre-processing affects prediction accuracy for bot whole seed and ground seed samples, 3) prediction using ground seed samples (0.64 R2 0.85) is better than the whole seed (0.33 R2 0.78), and 4) the data pre-processing second derivative with standard normal variate has the best prediction (R2_whole seed = 0.78, R2_ground seed = 0.85). The results will be of interest in cowpea breeding programs aimed at improving total seed protein content.

Multi-Branch Fault Line Location Method Based on Time Difference Matrix Fitting

The distribution network exhibits complex structural characteristics,which makes fault localization a challenging task.Especially when a branch of the multi-branch distribution network fails,the traditional multi-branch fault location algorithm makes it difficult to meet the demands of high-precision fault localization in the multi-branch distribution network system.In this paper,the multi-branch mainline is decomposed into single branch lines,transforming the complex multi-branch fault location problem into a double-ended fault location problem.Based on the different transmission characteristics of the fault-traveling wave in fault lines and non-fault lines,the endpoint reference time difference matrix S and the fault time difference matrix G were established.The time variation rule of the fault-traveling wave arriving at each endpoint before and after a fault was comprehensively utilized.To realize the fault segment location,the least square method was introduced.It was used to find the first-order fitting relation that satisfies the matching relationship between the corresponding row vector and the first-order function in the two matrices,to realize the fault segment location.Then,the time difference matrix is used to determine the traveling wave velocity,which,combined with the double-ended traveling wave location,enables accurate fault location.

Optimized CUDA Implementation to Improve the Performance of Bundle Adjustment Algorithm on GPUs

The 3D reconstruction pipeline uses the Bundle Adjustment algorithm to refine the camera and point parameters. The Bundle Adjustment algorithm is a compute-intensive algorithm, and many researchers have improved its performance by implementing the algorithm on GPUs. In the previous research work, “Improving Accuracy and Computational Burden of Bundle Adjustment Algorithm using GPUs,” the authors demonstrated first the Bundle Adjustment algorithmic performance improvement by reducing the mean square error using an additional radial distorting parameter and explicitly computed analytical derivatives and reducing the computational burden of the Bundle Adjustment algorithm using GPUs. The naïve implementation of the CUDA code, a speedup of 10× for the largest dataset of 13,678 cameras, 4,455,747 points, and 28,975,571 projections was achieved. In this paper, we present the optimization of the Bundle Adjustment algorithm CUDA code on GPUs to achieve higher speedup. We propose a new data memory layout for the parameters in the Bundle Adjustment algorithm, resulting in contiguous memory access. We demonstrate that it improves the memory throughput on the GPUs, thereby improving the overall performance. We also demonstrate an increase in the computational throughput of the algorithm by optimizing the CUDA kernels to utilize the GPU resources effectively. A comparative performance study of explicitly computing an algorithm parameter versus using the Jacobians instead is presented. In the previous work, the Bundle Adjustment algorithm failed to converge for certain datasets due to several block matrices of the cameras in the augmented normal equation, resulting in rank-deficient matrices. In this work, we identify the cameras that cause rank-deficient matrices and preprocess the datasets to ensure the convergence of the BA algorithm. Our optimized CUDA implementation achieves convergence of the Bundle Adjustment algorithm in around 22 seconds for the largest dataset compared to 654 seconds for the sequential implementation, resulting in a speedup of 30×. Our optimized CUDA implementation presented in this paper has achieved a 3× speedup for the largest dataset compared to the previous naïve CUDA implementation.

A Study of EM Algorithm as an Imputation Method: A Model-Based Simulation Study with Application to a Synthetic Compositional Data

Compositional data, such as relative information, is a crucial aspect of machine learning and other related fields. It is typically recorded as closed data or sums to a constant, like 100%. The statistical linear model is the most used technique for identifying hidden relationships between underlying random variables of interest. However, data quality is a significant challenge in machine learning, especially when missing data is present. The linear regression model is a commonly used statistical modeling technique used in various applications to find relationships between variables of interest. When estimating linear regression parameters which are useful for things like future prediction and partial effects analysis of independent variables, maximum likelihood estimation (MLE) is the method of choice. However, many datasets contain missing observations, which can lead to costly and time-consuming data recovery. To address this issue, the expectation-maximization (EM) algorithm has been suggested as a solution for situations including missing data. The EM algorithm repeatedly finds the best estimates of parameters in statistical models that depend on variables or data that have not been observed. This is called maximum likelihood or maximum a posteriori (MAP). Using the present estimate as input, the expectation (E) step constructs a log-likelihood function. Finding the parameters that maximize the anticipated log-likelihood, as determined in the E step, is the job of the maximization (M) phase. This study looked at how well the EM algorithm worked on a made-up compositional dataset with missing observations. It used both the robust least square version and ordinary least square regression techniques. The efficacy of the EM algorithm was compared with two alternative imputation techniques, k-Nearest Neighbor (k-NN) and mean imputation (), in terms of Aitchison distances and covariance.

Least Squares One-Class Support Tensor Machine

One-class classification problem has become a popular problem in many fields, with a wide range of applications in anomaly detection, fault diagnosis, and face recognition. We investigate the one-class classification problem for second-order tensor data. Traditional vector-based one-class classification methods such as one-class support vector machine (OCSVM) and least squares one-class support vector machine (LSOCSVM) have limitations when tensor is used as input data, so we propose a new tensor one-class classification method, LSOCSTM, which directly uses tensor as input data. On one hand, using tensor as input data not only enables to classify tensor data, but also for vector data, classifying it after high dimensionalizing it into tensor still improves the classification accuracy and overcomes the over-fitting problem. On the other hand, different from one-class support tensor machine (OCSTM), we use squared loss instead of the original loss function so that we solve a series of linear equations instead of quadratic programming problems. Therefore, we use the distance to the hyperplane as a metric for classification, and the proposed method is more accurate and faster compared to existing methods. The experimental results show the high efficiency of the proposed method compared with several state-of-the-art methods.

Simple Formulas of πin Terms of Φ

The paper presents a novel exploration of π through a re-calculation of formulas using Archimedes’ algorithm, resulting in the identification of a general family equation and three new formulas involving the golden ratio Φ, in the form of infinite nested square roots. Some related geometrical properties are shown, enhancing the link between the circle and the golden ratio. Applying the same criteria, a fourth formula is given, that brings to the known Dixon’s squaring the circle approximation, thus an easier approach to this problem is suggested, by a rectangle with both sides proportional to the golden ratio Φ.

Indirect Electroanalysis of 3-Methyl-4-Nitrophenol in Water Using Carbon Fiber Microelectrode Modified with Nickel Tetrasulfonated Phthalocyanine Complex

Electrochemical detection of 3-methyl-4-nitrophenol (MNP) in direct phenol oxidation occurs at high potentials and generally leads to progressive passivation of the electrochemical sensor. This study describes the use of a carbon fiber microelectrode modified with a tetrasulfonated nickel phthalocyanine complex for the detection of MNP at a lower potential than that of direct phenol oxidation. The MNP voltammogram showed the presence of an anodic peak at -0.11 V vs SCE, corresponding to the oxidation of the hydroxylamine group generated after the reduction of the nitro group. The effect of buffer pH on the peak current and SWV parameters such as frequency, scan increment, and pulse amplitude were studied and optimized to have better electrochemical response of the proposed sensor. With these optimal parameters, the calibration curve shows that the peak current varied linearly as a function of MNP concentration, leading to a limit of detection (LoD) of 1.1 μg/L. These results show an appreciable sensitivity of the sensor for detecting the MNP at relatively low potentials, making it possible to avoid passivation phenomena.