An Efficient Reliability-Based Optimization Method Utilizing High-Dimensional Model Representation and Weight-Point Estimation Method

The objective of reliability-based design optimization(RBDO)is to minimize the optimization objective while satisfying the corresponding reliability requirements.However,the nested loop characteristic reduces the efficiency of RBDO algorithm,which hinders their application to high-dimensional engineering problems.To address these issues,this paper proposes an efficient decoupled RBDO method combining high dimensional model representation(HDMR)and the weight-point estimation method(WPEM).First,we decouple the RBDO model using HDMR and WPEM.Second,Lagrange interpolation is used to approximate a univariate function.Finally,based on the results of the first two steps,the original nested loop reliability optimization model is completely transformed into a deterministic design optimization model that can be solved by a series of mature constrained optimization methods without any additional calculations.Two numerical examples of a planar 10-bar structure and an aviation hydraulic piping system with 28 design variables are analyzed to illustrate the performance and practicability of the proposed method.

Mesh representation matters:investigating the influence of different mesh features on perceptual and spatial fidelity of deep 3D morphable models

Background Deep 3D morphable models(deep 3DMMs)play an essential role in computer vision.They are used in facial synthesis,compression,reconstruction and animation,avatar creation,virtual try-on,facial recognition systems and medical imaging.These applications require high spatial and perceptual quality of synthesised meshes.Despite their significance,these models have not been compared with different mesh representations and evaluated jointly with point-wise distance and perceptual metrics.Methods We compare the influence of different mesh representation features to various deep 3DMMs on spatial and perceptual fidelity of the reconstructed meshes.This paper proves the hypothesis that building deep 3DMMs from meshes represented with global representations leads to lower spatial reconstruction error measured with L_(1) and L_(2) norm metrics and underperforms on perceptual metrics.In contrast,using differential mesh representations which describe differential surface properties yields lower perceptual FMPD and DAME and higher spatial fidelity error.The influence of mesh feature normalisation and standardisation is also compared and analysed from perceptual and spatial fidelity perspectives.Results The results presented in this paper provide guidance in selecting mesh representations to build deep 3DMMs accordingly to spatial and perceptual quality objectives and propose combinations of mesh representations and deep 3DMMs which improve either perceptual or spatial fidelity of existing methods.

Computation of the Rational Representation for Solutions of High-dimensional Systems

This paper deals with the representation of the solutions of a polynomial system, and concentrates on the high-dimensional case. Based on the rational univari- ate representation of zero-dimensional polynomial systems, we give a new description called rational representation for the solutions of a high-dimensional polynomial sys- tem and propose an algorithm for computing it. By this way all the solutions of any high-dimensional polynomial system can be represented by a set of so-called rational- representation sets.

Robust Latent Factor Analysis for Precise Representation of High-Dimensional and Sparse Data

High-dimensional and sparse(HiDS)matrices commonly arise in various industrial applications,e.g.,recommender systems(RSs),social networks,and wireless sensor networks.Since they contain rich information,how to accurately represent them is of great significance.A latent factor(LF)model is one of the most popular and successful ways to address this issue.Current LF models mostly adopt L2-norm-oriented Loss to represent an HiDS matrix,i.e.,they sum the errors between observed data and predicted ones with L2-norm.Yet L2-norm is sensitive to outlier data.Unfortunately,outlier data usually exist in such matrices.For example,an HiDS matrix from RSs commonly contains many outlier ratings due to some heedless/malicious users.To address this issue,this work proposes a smooth L1-norm-oriented latent factor(SL-LF)model.Its main idea is to adopt smooth L1-norm rather than L2-norm to form its Loss,making it have both strong robustness and high accuracy in predicting the missing data of an HiDS matrix.Experimental results on eight HiDS matrices generated by industrial applications verify that the proposed SL-LF model not only is robust to the outlier data but also has significantly higher prediction accuracy than state-of-the-art models when they are used to predict the missing data of HiDS matrices.

Chaos game representation walk model for the protein sequences

A new chaos game representation of protein sequences based on the detailed hydrophobic-hydrophilic （HP） model has been proposed by Yu et al （Physica A 337（2004） 171）. A CGR-walk model is proposed based on the new CGR coordinates for the protein sequences from complete genomes in the present paper. The new CCR coordinates based on the detailed HP model are converted into a time series, and a long-memory ARFIMA（p, d, q） model is introduced into the protein sequence analysis. This model is applied to simulating real CCR-walk sequence data of twelve protein sequences. Remarkably long-range correlations are uncovered in the data and the results obtained from these models are reasonably consistent with those available from the ARFIMA（p, d, q） model.

Randomized Latent Factor Model for High-dimensional and Sparse Matrices from Industrial Applications

Latent factor(LF) models are highly effective in extracting useful knowledge from High-Dimensional and Sparse(HiDS) matrices which are commonly seen in various industrial applications. An LF model usually adopts iterative optimizers,which may consume many iterations to achieve a local optima,resulting in considerable time cost. Hence, determining how to accelerate the training process for LF models has become a significant issue. To address this, this work proposes a randomized latent factor(RLF) model. It incorporates the principle of randomized learning techniques from neural networks into the LF analysis of HiDS matrices, thereby greatly alleviating computational burden. It also extends a standard learning process for randomized neural networks in context of LF analysis to make the resulting model represent an HiDS matrix correctly.Experimental results on three HiDS matrices from industrial applications demonstrate that compared with state-of-the-art LF models, RLF is able to achieve significantly higher computational efficiency and comparable prediction accuracy for missing data.I provides an important alternative approach to LF analysis of HiDS matrices, which is especially desired for industrial applications demanding highly efficient models.

Research on system-of-systems combat simulation model formal specification and representation

To makesystem-of-systems combat simulation models easy to be developed and reused, simulation model formal specification and representation are researched. According to the view of system-of-systems combat simulation, and based on DEVS, the simulation model＇s fundamental formalisms are explored. It includes entity model, system-of-systems model and experiment model. It also presents rigorous formal specification. XML data exchange standard is combined to design the XML based language, SCSL, to support simulation model representation. The corresponding relationship between SCSL and simulation model formalism is discussed and the syntax and semantics of elements in SCSL are detailed. Based on simulation model formal specification, the abstract simulation algorithm is given and SCSL virtual machine, which is capable of automatically interpreting and executing simulation model represented by SCSL, is designed. Finally an application case is presented, which can show the validation of the theory and verification of SCSL.

An iterative data-driven turbulence modeling framework based on Reynolds stress representation

Data-driven turbulence modeling studies have reached such a stage that the basic framework is settled,but several essential issues remain that strongly affect the performance.Two problems are studied in the current research:(1)the processing of the Reynolds stress tensor and(2)the coupling method between the machine learning model and flow solver.For the Reynolds stress processing issue,we perform the theoretical derivation to extend the relevant tensor arguments of Reynolds stress.Then,the tensor representation theorem is employed to give the complete irreducible invariants and integrity basis.An adaptive regularization term is employed to enhance the representation performance.For the coupling issue,an iterative coupling framework with consistent convergence is proposed and then applied to a canonical separated flow.The results have high consistency with the direct numerical simulation true values,which proves the validity of the current approach.

High-Dimensional Schwarzian Derivatives and Painlevé Integrable Models

Because all the known integrable models possess Schwarzian forms with Mobious transformation invariance,it may be one of the best ways to find new integrable models starting from some suitable Mobious transformation invariant equations. In this paper, we study the Painlevé integrability of some special (3+1)-dimensional Schwarzian models.

Application of Cochlear Model in Speech Analysis/Synthesis Using Sinusoidal Representation

A sinusoidal representation of speech and a cochlear model are used to extract speech parameters in this paper, and a speech analysis/synthesis system controlled by the auditory spectrum is developed with the model. The computer simulation shows that speech can be synthesized with only 12 parameters per frame on the average. The method has the advantages of few parameters, low complexity and high performance of speech representation. The synthetic speech has high intelligibility.

Using Vector Representation of Propositions and Actions for STRIPS Action Model Learning

Action model learning has become a hot topic in knowledge engineering for automated planning.A key problem for learning action models is to analyze state changes before and after action executions from observed"plan traces".To support such an analysis,a new approach is proposed to partition propositions of plan traces into states.First,vector representations of propositions and actions are obtained by training a neural network called Skip-Gram borrowed from the area of natural language processing(NLP).Then,a type of semantic distance among propositions and actions is defined based on their similarity measures in the vector space.Finally,k-means and k-nearest neighbor(kNN)algorithms are exploited to map propositions to states.This approach is called state partition by word vector(SPWV),which is implemented on top of a recent action model learning framework by Rao et al.Experimental results on the benchmark domains show that SPWV leads to a lower error rate of the learnt action model,compared to the probability based approach for state partition that was developed by Rao et al.

A Phrase Topic Model Based on Distributed Representation

Traditional topic models have been widely used for analyzing semantic topics from electronic documents.However,the obvious defects of topic words acquired by them are poor in readability and consistency.Only the domain experts are possible to guess their meaning.In fact,phrases are the main unit for people to express semantics.This paper presents a Distributed Representation-Phrase Latent Dirichlet Allocation(DR-Phrase LDA)which is a phrase topic model.Specifically,we reasonably enhance the semantic information of phrases via distributed representation in this model.The experimental results show the topics quality acquired by our model is more readable and consistent than other similar topic models.

Knowledge representation and rule-based solution system for dynamic programming model

A knowledge representation has been proposed using the state space theory of Artificial Intelligence for Dynamic Programming Model, in which a model can be defined as a six tuple M=(I,G,O,T,D,S). A building block modeling method uses the modules of a six tuple to form a rule based solution model. Moreover, a rule based system has been designed and set up to solve the Dynamic Programming Model. This knowledge based representation can be easily used to express symbolical knowledge and dynamic characteristics for Dynamic Programming Model, and the inference based on the knowledge in the process of solving Dynamic Programming Model can also be conveniently realized in computer.

Variance Estimation for High-Dimensional Varying Index Coefficient Models

This paper studies the re-adjusted cross-validation method and a semiparametric regression model called the varying index coefficient model. We use the profile spline modal estimator method to estimate the coefficients of the parameter part of the Varying Index Coefficient Model (VICM), while the unknown function part uses the B-spline to expand. Moreover, we combine the above two estimation methods under the assumption of high-dimensional data. The results of data simulation and empirical analysis show that for the varying index coefficient model, the re-adjusted cross-validation method is better in terms of accuracy and stability than traditional methods based on ordinary least squares.

A Review on High-Dimensional Frequentist Model Averaging

Model averaging has attracted increasing attention in recent years for the analysis of high-dimensional data. By weighting several competing statistical models suitably, model averaging attempts to achieve stable and improved prediction. To obtain a better understanding of the available model averaging methods, their properties and the relationships between them, this paper is devoted to make a review on some recent progresses in high-dimensional model averaging from the frequentist perspective. Some future research topics are also discussed.

A General Representation of Geometrical Solution Model for Predicting Ternary Thermodynamic Properties

The existing geometrical solution models for predicting ternary thermodynamic properties from relevant binary ones have been analysed,and a general representation was proposed in an integral form on the bases of these models.

Explicit Algebraic Stress Model for Three-Dimensional Turbulent Buoyant Flows Derived Using Tensor Representation

An explicit algebraic stress model (EASM) has been formulated for two-dimensional turbulent buoyant flows using a five-term tensor representation in a prior study. The derivation was based on partitioning the buoyant flux tensor into a two-dimensional and a three-dimensional component. The five-term basis was formed with the two-dimensional component of the buoyant flux tensor. As such, the derived EASM is limited to two-dimensional flows only. In this paper, a more general approach using a seven-term representation without partitioning the buoyant flux tensor is used to derive an EASM valid for two- and three-dimensional turbulent buoyant flows. Consequently, the basis tensors are formed with the fully three-dimensional buoyant flux tensor. The derived EASM has the two-dimensional flow as a special case. The matrices and the representation coefficients are further simplified using a four-term representation. When this four-term representation model is applied to calculate two-dimensional homogeneous buoyant flows, the results are essentially identical with those obtained previously using the two-dimensional component of the buoyant flux tensor. Therefore, the present approach leads to a more general EASM formulation that is equally valid for two- and three-dimensional turbulent buoyant flows.

A FORMAL REPRESENTATION FOR FEATURE-BASED DESIGN

Feature based design has been regarded as a promising approach for CAD/CAM integration.This paper aims to establish a domain independent representation formalism for feature based design in three aspects: formal representation,design process model and design algorithm.The implementing scheme and formal description of feature taxonomy,feature operator,feature model validation and feature transformation are given in the paper.The feature based design process model suited for either sequencial or concurrent engineering is proposed and its application to product structural design and process plan design is presented. Some general design algorithms for developing feature based design system are also addressed.The proposed scheme provides a formal methodology elementary for feature based design system development and operation in a structural way.

Applications of Fractional Lower Order Time-frequency Representation to Machine Bearing Fault Diagnosis

The machinery fault signal is a typical non-Gaussian and non-stationary process. The fault signal can be described by SaS distribution model because of the presence of impulses.Time-frequency distribution is a useful tool to extract helpful information of the machinery fault signal. Various fractional lower order(FLO) time-frequency distribution methods have been proposed based on fractional lower order statistics, which include fractional lower order short time Fourier transform(FLO-STFT), fractional lower order Wigner-Ville distributions(FLO-WVDs), fractional lower order Cohen class time-frequency distributions(FLO-CDs), fractional lower order adaptive kernel time-frequency distributions(FLO-AKDs) and adaptive fractional lower order time-frequency auto-regressive moving average(FLO-TFARMA) model time-frequency representation method.The methods and the exiting methods based on second order statistics in SaS distribution environments are compared, simulation results show that the new methods have better performances than the existing methods. The advantages and disadvantages of the improved time-frequency methods have been summarized.Last, the new methods are applied to analyze the outer race fault signals, the results illustrate their good performances.

Research on image sentiment analysis technology based on sparse representation

Many methods based on deep learning have achieved amazing results in image sentiment analysis.However,these existing methods usually pursue high accuracy,ignoring the effect on model training efficiency.Considering that when faced with large-scale sentiment analysis tasks,the high accuracy rate often requires long experimental time.In view of the weakness,a method that can greatly improve experimental efficiency with only small fluctuations in model accuracy is proposed,and singular value decomposition(SVD)is used to find the sparse feature of the image,which are sparse vectors with strong discriminativeness and effectively reduce redundant information;The authors propose the Fast Dictionary Learning algorithm(FDL),which can combine neural network with sparse representation.This method is based on K-Singular Value Decomposition,and through iteration,it can effectively reduce the calculation time and greatly improve the training efficiency in the case of small fluctuation of accuracy.Moreover,the effectiveness of the proposed method is evaluated on the FER2013 dataset.By adding singular value decomposition,the accuracy of the test suite increased by 0.53%,and the total experiment time was shortened by 8.2%;Fast Dictionary Learning shortened the total experiment time by 36.3%.