Underwater Image Classification Based on EfficientnetB0 and Two-Hidden-Layer Random Vector Functional Link

The ocean plays an important role in maintaining the equilibrium of Earth’s ecology and providing humans access to a wealth of resources.To obtain a high-precision underwater image classification model,we propose a classification model that combines an EfficientnetB0 neural network and a two-hidden-layer random vector functional link network(EfficientnetB0-TRVFL).The features of underwater images were extracted using the EfficientnetB0 neural network pretrained via ImageNet,and a new fully connected layer was trained on the underwater image dataset using the transfer learning method.Transfer learning ensures the initial performance of the network and helps in the development of a high-precision classification model.Subsequently,a TRVFL was proposed to improve the classification property of the model.Net construction of the two hidden layers exhibited a high accuracy when the same hidden layer nodes were used.The parameters of the second hidden layer were obtained using a novel calculation method,which reduced the outcome error to improve the performance instability caused by the random generation of parameters of RVFL.Finally,the TRVFL classifier was used to classify features and obtain classification results.The proposed EfficientnetB0-TRVFL classification model achieved 87.28%,74.06%,and 99.59%accuracy on the MLC2008,MLC2009,and Fish-gres datasets,respectively.The best convolutional neural networks and existing methods were stacked up through box plots and Kolmogorov-Smirnov tests,respectively.The increases imply improved systematization properties in underwater image classification tasks.The image classification model offers important performance advantages and better stability compared with existing methods.

Fully Distributed Learning for Deep Random Vector Functional-Link Networks

In the contemporary era, the proliferation of information technology has led to an unprecedented surge in data generation, with this data being dispersed across a multitude of mobile devices. Facing these situations and the training of deep learning model that needs great computing power support, the distributed algorithm that can carry out multi-party joint modeling has attracted everyone’s attention. The distributed training mode relieves the huge pressure of centralized model on computer computing power and communication. However, most distributed algorithms currently work in a master-slave mode, often including a central server for coordination, which to some extent will cause communication pressure, data leakage, privacy violations and other issues. To solve these problems, a decentralized fully distributed algorithm based on deep random weight neural network is proposed. The algorithm decomposes the original objective function into several sub-problems under consistency constraints, combines the decentralized average consensus (DAC) and alternating direction method of multipliers (ADMM), and achieves the goal of joint modeling and training through local calculation and communication of each node. Finally, we compare the proposed decentralized algorithm with several centralized deep neural networks with random weights, and experimental results demonstrate the effectiveness of the proposed algorithm.

Photon Structure and Wave Function from the Vector Potential Quantization

A photon structure is advanced based on the experimental evidence and the vector potential quantization at a single photon level. It is shown that the photon is neither a point particle nor an infinite wave but behaves rather like a local “wave-corpuscle” extended over a wavelength, occupying a minimum quantization volume and guided by a non-local vector potential real wave function. The quantized vector potential oscillates over a wavelength with circular left or right polarization giving birth to orthogonal magnetic and electric fields whose amplitudes are proportional to the square of the frequency. The energy and momentum are carried by the local wave-corpuscle guided by the non-local vector potential wave function suitably normalized.

Whole Perfect Vectors and Fermat’s Last Theorem

A naïve discussion of Fermat’s last theorem conundrum is described. The present theorem’s proof is grounded on the well-known properties of sums of powers of the sine and cosine functions, the Minkowski norm definition, and some vector-specific structures.

Multivariable Dynamic Modeling for Molten Iron Quality Using Incremental Random Vector Functional-link Networks

Molten iron temperature as well as Si, P, and S contents is the most essential molten iron quality （MIQ） indices in the blast furnace （BF） ironmaking, which requires strict monitoring during the whole ironmaking production. However, these MIQ parameters are difficult to be directly measured online, and large-time delay exists in off-line analysis through laboratory sampling. Focusing on the practical challenge, a data-driven modeling method was presented for the prediction of MIQ using the improved muhivariable incremental random vector functional-link net- works （M-I-RVFLNs）. Compared with the conventional random vector functional-link networks （RVFLNs） and the online sequential RVFLNs, the M-I-RVFLNs have solved the problem of deciding the optimal number of hidden nodes and overcome the overfitting problems. Moreover, the proposed M I RVFLNs model has exhibited the potential for multivariable prediction of the MIQ and improved the terminal condition for the multiple-input multiple-out- put （MIMO） dynamic system, which is suitable for the BF ironmaking process in practice. Ultimately, industrial experiments and contrastive researches have been conducted on the BF No. 2 in Liuzhou Iron and Steel Group Co. Ltd. of China using the proposed method, and the results demonstrate that the established model produces better estima ting accuracy than other MIQ modeling methods.

Multivariate quasi-tight framelets with high balancing orders derived from any compactly supported refinable vector functions

Generalizing wavelets by adding desired redundancy and flexibility,framelets(i.e.,wavelet frames)are of interest and importance in many applications such as image processing and numerical algorithms.Several key properties of framelets are high vanishing moments for sparse multiscale representation,fast framelet transforms for numerical efficiency,and redundancy for robustness.However,it is a challenging problem to study and construct multivariate nonseparable framelets,mainly due to their intrinsic connections to factorization and syzygy modules of multivariate polynomial matrices.Moreover,all the known multivariate tight framelets derived from spline refinable scalar functions have only one vanishing moment,and framelets derived from refinable vector functions are barely studied yet in the literature.In this paper,we circumvent the above difficulties through the approach of quasi-tight framelets,which behave almost identically to tight framelets.Employing the popular oblique extension principle(OEP),from an arbitrary compactly supported M-refinable vector functionφwith multiplicity greater than one,we prove that we can always derive fromφa compactly supported multivariate quasi-tight framelet such that:(i)all the framelet generators have the highest possible order of vanishing moments;(ii)its associated fast framelet transform has the highest balancing order and is compact.For a refinable scalar functionφ(i.e.,its multiplicity is one),the above item(ii)often cannot be achieved intrinsically but we show that we can always construct a compactly supported OEP-based multivariate quasi-tight framelet derived fromφsatisfying item(i).We point out that constructing OEP-based quasi-tight framelets is closely related to the generalized spectral factorization of Hermitian trigonometric polynomial matrices.Our proof is critically built on a newly developed result on the normal form of a matrix-valued filter,which is of interest and importance in itself for greatly facilitating the study of refinable vector functions and multiwavelets/multiframelets.This paper provides a comprehensive investigation on OEP-based multivariate quasi-tight multiframelets and their associated framelet transforms with high balancing orders.This deepens our theoretical understanding of multivariate quasi-tight multiframelets and their associated fast multiframelet transforms.

On stability of discontinuous systems via vector Lyapunov functions

This paper deals with the stability of systems with discontinuous righthand side （with solutions in Filippov＇s sense） via locally Lipschitz continuous and regular vector Lyapunov functions. A new type of “set-valued derivative” of vector Lyapunov functions is introduced, some generalized comparison principles on discontinuous systems are shown. Furthermore, Lyapunov stability theory is developed for a class of discontinuous systems based on locally Lipschitz continuous and regular vector Lyapunov functions.

AN INEQUALITY ON THE ZEROS AND POLES OF VECTOR VALUED MEROMORPHIC FUNCTIONS

The author proves that if f ： C → C^n is a transcendental vector valued mero-morphic function of finite order and assume, This result extends the related results for meromorphic function by Singh and Kulkarni.

Adjustable entropy function method for support vector machine

Based on KKT complementary condition in optimization theory, an unconstrained non-differential optimization model for support vector machine is proposed. An adjustable entropy function method is given to deal with the proposed optimization problem and the Newton algorithm is used to figure out the optimal solution. The proposed method can find an optimal solution with a relatively small parameter p, which avoids the numerical overflow in the traditional entropy function methods. It is a new approach to solve support vector machine. The theoretical analysis and experimental results illustrate the feasibility and efficiency of the proposed algorithm.

ON VECTOR VALUED FUNCTION APPROXIMATION USING A PEAK NORM

A peak norm is defined for Lp spaces of E-valued Bochner integrable functions, where E is a Banach space, and best approximations from a sun to elements of the space are characterized. Applications are given to some families of simultaneous best approximation problems.

NORMAL AND ABNORMAL CYLINDRICAL VECTOR WAVE FUNCTIONS AND SOME IMPORTANT CONVERSION RELATIONS

The normal and abnormal cylindrical vector wave functions are constructed. Some impor-tant conversion relations in circular, elliptic and parabolic cylindrical coordinate systems are discussedin detail, where the result in circular cylindrical coordinate system is the same as the one given bythe author (1984).

CONFIGURATION FROM TRUTH VECTOR TO XOR FUNCTION

Kamaugh maps are widely used in the logic synthesis. However, the number of the variable it can deal with is limited. In this paper, two kinds of function shrinking techniques are proposed, and a fast algorithm to configure a truth vector into a XOR function is realized. There is no variable number limitation for this algorithm.

On the Differentiability of Vector Valued Additive Set Functions

The Lebesgue-Nikodym Theorem states that for a Lebesgue measure an additive set function ?which is -absolutely continuous is the integral of a Lebegsue integrable a measurable function;that is, for all measurable sets.?Such a property is not shared by vector valued set functions. We introduce a suitable definition of the integral that will extend the above property to the vector valued case in its full generality. We also discuss a further extension of the Fundamental Theorem of Calculus for additive set functions with values in an infinite dimensional normed space.

VECTOR WAVE FUNCTION EXPANSION FOR SOLVING ELECTROMAGNETIC SCATTERING BY BURIED OBJECTS

An analysis of solving the electromagnetic scattering by buried objects using vectorwave function expansion is presented.For expanding the boundary conditions both on the planarair-earth interface and on the spherical surface,the conversion relations between the cylindricaland spherical vector wave functions are derived.Hence the vector wave function expansion isconveniently applied to solve this complex boundary-value problem.For the excitation of the in-cident plane wave and the dipole above the earth,the scatterlng patterns of the buried conductingand dielectric spheres are presented and discussed.

A SYSTEM IDENTIFICATION METHOD USING VECTOR SPACE BASE FUNCTION

This paper presents a new system identification approach using vector space base functions, and proposes two network structures based on Gamma sequence and Laguerre sequence. After analyzing and comparing these structures in detail, some simulation results to demonstrate the conclusions are given.

Path Loss Modeling: A Machine Learning Based Approach Using Support Vector Regression and Radial Basis Function Models

Path loss prediction models are vital for accurate signal propagation in wireless channels. Empirical and deterministic models used in path loss predictions have not produced optimal results. In this paper, we introduced machine learning algorithms to path loss predictions because it offers a flexible network architecture and extensive data can be used. We introduced support vector regression (SVR) and radial basis function (RBF) models to path loss predictions in the investigated environments. The SVR model was able to process several input parameters without introducing complexity to the network architecture. The RBF on its part provides a good function approximation. Hyperparameter tuning of the machine learning models was carried out in order to achieve optimal results. The performances of the SVR and RBF models were compared and result validated using the root-mean squared error (RMSE). The two machine learning algorithms were also compared with the Cost-231, SUI, Egli, Freespace, Cost-231 W-I models. The analytical models overpredicted path loss. Overall, the machine learning models predicted path loss with greater accuracy than the empirical models. The SVR model performed best across all the indices with RMSE values of 1.378 dB, 1.4523 dB, 2.1568 dB in rural, suburban and urban settings respectively and should therefore be adopted for signal propagation in the investigated environments and beyond.

Fuzzy smooth support vector machine with different smooth functions

Smooth support vector machine （SSVM） changs the normal support vector machine （SVM） into the unconstrained op- timization by using the smooth sigmoid function. The method can be solved under the Broyden-Fletcher-Goldfarb-Shanno （BFGS） algorithm and the Newdon-Armijio （NA） algorithm easily, however the accuracy of sigmoid function is not as good as that of polyno- mial smooth function. Furthermore, the method cannot reduce the influence of outliers or noise in dataset. A fuzzy smooth support vector machine （FSSVM） with fuzzy membership and polynomial smooth functions is introduced into the SVM. The fuzzy member- ship considers the contribution rate of each sample to the optimal separating hyperplane and makes the optimization problem more accurate at the inflection point. Those changes play a positive role on trials. The results of the experiments show that those FSSVMs can obtain a better accuracy and consume the shorter time than SSVM and lagrange support vector machine （LSVM）.

再议量子理论的表述形式与诠释

量子力学建立至今已达百年,关于量子力学仍存留许多困惑与争议。我们注意到可能的原因是状态矢量表示理念的不一致,以及混淆了不同的波函数概率诠释。我们认识到,坚持把状态矢量表示为无量纲的对象,认清波函数的薛定谔、玻恩和狄拉克各自诠释的不同以及薛定谔、玻恩的概率诠释可以经由狄拉克完备性关系联系起来,认识到概率行为出现在无量纲的态矢/波函数与决定性的状态方程之外,则可以消除不少关于量子力学的误解。

基于正弦函数拟合的高动态捷联惯导姿态更新算法

为提高捷联惯导在高动态条件下的姿态解算精度,基于等效旋转矢量泰勒级数展开法,提出一种基于正弦函数拟合的高动态捷联惯导姿态更新算法。以正弦函数拟合载体运动角速度,考虑Bortz方程高阶项的影响,对陀螺角增量表示的旋转矢量进行泰勒六阶展开,对比旋转矢量不同形式表达式求得误差补偿系数。在MATLAB平台上,以圆锥运动与大角速率转动并存环境作为仿真条件,对所提算法与传统算法进行对比仿真分析。仿真结果表明,在小半锥角低频圆锥运动伴随高速角速率转动情况下,所提算法性能较好,当半锥角为0.5°、角频率为2.26πrad/s、常值角速率为5.30 rad/s、姿态解算周期为0.02 s时,所提正弦函数拟合三子样旋转矢量算法与传统扩展形式频率级数/显示频率三子样圆锥算法相比误差降低了2个数量级。

基于RUL和SVs-GFF的云服务器老化预测方法

针对云服务器中存在软件老化现象,将造成系统性能衰退与可靠性下降问题,借鉴剩余使用寿命(Remaining useful life,RUL)概念,提出基于支持向量和高斯函数拟合(Support vectors and Gaussian function fitting,SVs-GFF)的老化预测方法.首先,提取云服务器老化数据的统计特征指标,并采用支持向量回归(Support vector regression,SVR)对统计特征指标进行数据稀疏化处理,得到支持向量(Support vectors,SVs)序列数据;然后,建立基于密度聚类的高斯函数拟合(Gaussian function fitting,GFF)模型,对不同核函数下的支持向量序列数据进行老化曲线拟合,并采用Fréchet距离优化算法选取最优老化曲线;最后,基于最优老化曲线,评估系统到达老化阈值前的RUL,以预测系统何时发生老化.在OpenStack云服务器4个老化数据集上的实验结果表明,基于RUL和SVs-GFF的云服务器老化预测方法与传统预测方法相比,具有更高的预测精度和更快的收敛速度.