Search

With the rapid development of pure electric vehicles, how to improve the range has become the focus of research. Due to the large shell mass of the battery pack shell (BPE), it is necessary to optimize its structure in turn. In this paper, the BPE model was reconstructed by improving the upper shell material and adding reinforcements following the direction of the leaf vein fibers of the Magnolia Grandiflora. A quasi-Monte Carlo method based on Sobol sequences and a Latin hypercube design with variance sensitivity analysis was used to determine the seven design variables. The 122 data sets were trained and predicted using the basic gradient descent algorithm combined with the conjugate direction method, and the predictions were compared with static mechanical simulations for sharp cornering conditions on bumpy roads. The results showed that the BPE weight reduction ratio was 19.5%, and the maximum stress reduction ratio was 27.49%, and the displacement reduction ratio was 29.29% respectively, which satisfied the material requirements. It had a 20.88% increase in first-order mode frequency, which effectively prevented resonance. [ABSTRACT FROM AUTHOR]

Fuzzy support vector machine and their variants are prominent classification techniques that reduce the adverse effects of noises and outliers as compare to classical support vector machine. However, in these methods, only the distance between the training pattern and the class center is considered, and hence, the edge support vectors cannot be distinguished from noises and outliers properly. These limitations are overcome by intuitionistic fuzzy-based support vector machine which allocate two parameters (membership and non-membership degrees) to each pattern of a dataset and hence define score number based on the importance of a pattern. In this paper, an intuitionistic fuzzy proximal support vector machine for multi-category classification problems is proposed. The method significantly reduces the impacts of noises and outliers present in the dataset by assigning the intuitionistic fuzzy score function to each training point based on its location and surroundings. Moreover, the method is computationally efficient as the robust classifiers are obtained by solving the system of linear equations instead of large size quadratic programming problems. In the proposed method, using polynomial and Gaussian kernels, the hyperplanes are also developed in the feature space. The geometrical advantages of the suggested method over the existing techniques are ascertained using the simulated two-dimensional artificial dataset having three target classes. Further, extensive experimental studies on ten UCI benchmark datasets have been performed which demonstrate that the proposed algorithm predicts more precisely about future data as comparison to some well-established algorithms. Figures are also illustrated by varying different parameters involved in the model which confirms the performance of the method over the existing algorithms. Moreover, the analysis of the predictive behavior of the proposed approach is done using the Friedman test, a nonparametric alternative to the analysis of variance test at 5 % significance level. Further, the proposed method has also been applied to image classification and gesture-phase segmentation problems which confirms the efficiency and handling capabilities of the proposed algorithm in practical applications. [ABSTRACT FROM AUTHOR]

The AMMI/GGE model can be used to describe a two-way table of genotype-environment means. When the genotype-environment means are independent and homoscedastic, ordinary least squares (OLS) gives optimal estimates of the model. In plant breeding, the assumption of independence and homoscedasticity of the genotype-environment means is frequently violated, however, such that generalized least squares (GLS) estimation is more appropriate. This paper introduces three different GLS algorithms that use a weighting matrix to take the correlation between the genotype-environment means as well as heteroscedasticity into account. To investigate the effectiveness of the GLS estimation, the proposed algorithms were implemented using three different weighting matrices, including (i) an identity matrix (OLS estimation), (ii) an approximation of the complete inverse covariance matrix of the genotype-environment means, and (iii) the complete inverse covariance matrix of the genotype-environment means. Using simulated data modeled on real experiments, the different weighting methods were compared in terms of the mean-squared error of the genotype-environment means, interaction effects, and singular vectors. The results show that weighted estimation generally outperformed unweighted estimation in terms of the mean-squared error. Furthermore, the effectiveness of the weighted estimation increased when the heterogeneity of the variances of the genotype-environment means increased. [ABSTRACT FROM AUTHOR]

The computations involving the noncentral- F distribution are notoriously difficult to implement properly in floating-point arithmetic: Catastrophic loss of precision, floating-point underflow and overflow, drastically increasing computation time and program hang-ups, and instability due to numerical cancellation have all been reported. It is therefore recommended that existing statistical packages are cross-checked, and the present paper proposes a numerical algorithm precisely for this purpose. To the best of our knowledge, the proposed method is the first method that can compute the noncentrality parameter of the noncentral- F distribution with guaranteed accuracy over a wide parameter range that spans the range relevant for practical applications. Although the proposed method is limited to cases where the the degree of freedom of the denominator of the F test statistic is even, it does not affect its usefulness significantly: All of those algorithmic failures and inaccuracies that we can still reproduce today could have been prevented by simply cross-checking against the proposed method. Two numerical examples are presented where the intermediate computations went wrong silently, but the final result of the computations seemed nevertheless plausible, and eventually erroneous results were published. Cross-checking against the proposed method would have caught the numerical errors in both cases. The source code of the algorithm is available on GitHub, together with self-contained command-line executables. These executables can read the data to be cross-checked from plain text files, making it easy to cross-check any statistical software in an automated fashion. [ABSTRACT FROM AUTHOR]

Cluster validity indexes are very important tools designed for two purposes: comparing the performance of clustering algorithms and determining the number of clusters that best fits the data. These indexes are in general constructed by combining a measure of compactness and a measure of separation. A classical measure of compactness is the variance. As for separation, the distance between cluster centers is used. However, such a distance does not always reflect the quality of the partition between clusters and sometimes gives misleading results. In this paper, we propose a new cluster validity index for which Jeffrey divergence is used to measure separation between clusters. Experimental results are conducted using different types of data and comparison with widely used cluster validity indexes demonstrates the outperformance of the proposed index. [ABSTRACT FROM AUTHOR]

Data augmentation (DA) algorithm is a widely used Markov chain Monte Carlo algorithm. In this paper, an alternative to DA algorithm is proposed. It is shown that the modified Markov chain is always more efficient than DA in the sense that the asymptotic variance in the central limit theorem under the alternative chain is no larger than that under DA. The modification is based on Peskun's (Biometrika 60:607-612, ) result which shows that asymptotic variance of time average estimators based on a finite state space reversible Markov chain does not increase if the Markov chain is altered by increasing all off-diagonal probabilities. In the special case when the state space or the augmentation space of the DA chain is finite, it is shown that Liu's (Biometrika 83:681-682, ) modified sampler can be used to improve upon the DA algorithm. Two illustrative examples, namely the beta-binomial distribution, and a model for analyzing rank data are used to show the gains in efficiency by the proposed algorithms. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of mother wavelet selection for wavelet signal processing in feature extraction and pattern recognition. The problem is formulated as an optimization criterion, where a wavelet library is defined using a set of parameters to find the best mother wavelet function. For estimating the fitness function, adopted to evaluate the performance of the wavelet function, analysis of variance is used. Genetic algorithm is exploited to optimize the determination of the best mother wavelet function. For experimental evaluation, solutions for best mother wavelet selection are evaluated on various biomedical signal classification problems, where the solutions of the proposed algorithm are assessed and compared with manual hit-and-trial methods. The results show that the solutions of automated mother wavelet selection algorithm are consistent with the manual selection of wavelet functions. The algorithm is found to be invariant to the type of signals used for classification. [ABSTRACT FROM AUTHOR]

Modal Identification from response data only is studied for structural systems under nonstationary ambient vibration. The topic of this paper is the estimation of modal parameters from nonstationary ambient vibration data by applying the random decrement algorithm with time-varying threshold level. In the conventional random decrement algorithm, the threshold level for evaluating randomdec signatures is defined as the standard deviation value of response data of the reference channel. The distortion of randomdec signatures may be, however, induced by the error involved in noise from the original response data in practice. To improve the accuracy of identification, a modification of the sampling procedure in random decrement algorithm is proposed for modal-parameter identification from the nonstationary ambient response data. The time-varying threshold level is presented for the acquisition of available sample time history to perform averaging analysis, and defined as the temporal root-mean-square function of structural response, which can appropriately describe a wide variety of nonstationary behaviors in reality, such as the time-varying amplitude (variance) of a nonstationary process in a seismic record. Numerical simulations confirm the validity and robustness of the proposed modal-identification method from nonstationary ambient response data under noisy conditions. [ABSTRACT FROM AUTHOR]

Due to the environmental noise, variance is uncertain and unknown. The energy-based detection (ED) technology has many shortcomings in cognitive radio. In the paper, an energy-autocorrelation detection (EAD) algorithm is proposed to overcome these challenges, taking advantage of the different characteristics of Gauss white noise and signal. Two statistics are structured based on energy and autocorrelation of samples. This spectrum sensing algorithm can lead to stable and accurate detection performance without any prior information on noise and signal. It is testified in the simulation that the energy-autocorrelation-based detection is much better than energy-based detection; moreover, the impact of some parameters of the algorithm is also simulated and discussed. [ABSTRACT FROM AUTHOR]

We study two-stage robust variants of combinatorial optimization problems on undirected graphs, like Steiner tree, Steiner forest, and uncapacitated facility location. Robust optimization problems, previously studied by Dhamdhere et al. (Proc. of 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), pp. 367-378, ), Golovin et al. (Proc. of the 23rd Annual Symposium on Theoretical Aspects of Computer Science (STACS), ), and Feige et al. (Proc. of the 12th International Integer Programming and Combinatorial Optimization Conference, pp. 439-453, ), are two-stage planning problems in which the requirements are revealed after some decisions are taken in Stage 1. One has to then complete the solution, at a higher cost, to meet the given requirements. In the robust k-Steiner tree problem, for example, one buys some edges in Stage 1. Then k terminals are revealed in Stage 2 and one has to buy more edges, at a higher cost, to complete the Stage 1 solution to build a Steiner tree on these terminals. The objective is to minimize the total cost under the worst-case scenario. In this paper, we focus on the case of exponentially many scenarios given implicitly. A scenario consists of any subset of k terminals (for k-Steiner tree), or any subset of k terminal-pairs (for k-Steiner forest), or any subset of k clients (for facility location). Feige et al. (Proc. of the 12th International Integer Programming and Combinatorial Optimization Conference, pp. 439-453, ) give an LP-based general framework for approximation algorithms for a class of two stage robust problems. Their framework cannot be used for network design problems like k-Steiner tree (see later elaboration). Their framework can be used for the robust facility location problem, but gives only a logarithmic approximation. We present the first constant-factor approximation algorithms for the robust k-Steiner tree (with exponential number of scenarios) and robust uncapacitated facility location problems. Our algorithms are combinatorial and are based on guessing the optimum cost and clustering to aggregate nearby vertices. For the robust k-Steiner forest problem on trees and with uniform multiplicative increase factor for Stage 2 (also known as inflation), we present a constant approximation. We show APX-hardness of the robust min-cut problem (even with singleton-set scenarios), resolving an open question of (Dhamdhere et al. in Proc. of 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), pp. 367-378, ) and (Golovin et al. in Proc. of the 23rd Annual Symposium on Theoretical Aspects of Computer Science (STACS), ). [ABSTRACT FROM AUTHOR]

The quality of propensity scores is traditionally measured by assessing how well they make the distributions of covariates in the treatment and control groups match, which we refer to as 'good balance'. Good balance guarantees less biased estimates of the treatment effect. However, the cost of achieving good balance is that the variance of the estimates increases due to a reduction in effective sample size, either through the introduction of propensity score weights or dropping cases when propensity score matching. In this paper, we investigate whether it is best to optimize the balance or to settle for a less than optimal balance and use double robust estimation to adjust for remaining differences. We compare treatment effect estimates from regression, propensity score weighting, and double robust estimation with varying levels of effort expended to achieve balance using data from a study about the differences in outcomes by HIV status in heterosexually active homeless men residing in Los Angeles. Because of how costly data collection efforts are for this population, it is important to find an alternative estimation method that does not reduce effective sample size as much as methods that aggressively aim to optimize balance. Results from a simulation study suggest that there are instances in which we can obtain more precise treatment effect estimates without increasing bias too much by using a combination of regression and propensity score weights that achieve a less than optimal balance. There is a bias-variance tradeoff at work in propensity score estimation; every step toward better balance usually means an increase in variance and at some point a marginal decrease in bias may not be worth the associated increase in variance. [ABSTRACT FROM AUTHOR]

In this paper, we present an algorithm suitable for analysing the variance of panel data when some observations are either given in grouped form or are missed. The analysis is carried out from the perspective of ANOVA panel data models with general errors. The classification intervals of the grouped observations may vary from one to another, thus the missing observations are in fact a particular case of grouping. The proposed Algorithm (1) estimates the parameters of the panel data models; (2) evaluates the covariance matrices of the asymptotic distribution of the time-dependent parameters assuming that the number of time periods, T, is fixed and the number of individuals, N, tends to infinity and similarly, of the individual parameters when T → ∞ and N is fixed; and, finally, (3) uses these asymptotic covariance matrix estimations to analyse the variance of the panel data. [ABSTRACT FROM AUTHOR]

This paper presents the development of a parameter optimization system that integrates mold flow analysis, the Taguchi method, analysis of variance (ANOVA), back-propagation neural networks (BPNNs), genetic algorithms (GAs), and the Davidon–Fletcher–Powell (DFP) method to generate optimal process parameter settings for multiple-input single-output plastic injection molding. In the computer-aided engineering simulations, Moldex3D software was employed to determine the preliminary process parameter settings. For process parameter optimization, an L25 orthogonal array experiment was conducted to arrange the number of experimental runs. The injection time, velocity pressure switch position, packing pressure, and injection velocity were employed as process control parameters, with product weight as the target quality. The significant process parameters influencing the product weight and the signal to noise (S/N) ratio were determined using experimental data based on the ANOVA method. Experimental data from the Taguchi method were used to train and test the BPNNs. Then, the BPNN was combined with the DFP method and the GAs to determine the final optimal parameter settings. Three confirmation experiments were performed to verify the effectiveness of the proposed system. Experimental results show that the proposed system not only avoids shortcomings inherent in the commonly used Taguchi method but also produced significant quality and cost advantages. [ABSTRACT FROM AUTHOR]

Many real applications can be formulated as nonlinear minimization problems with a single linear equality constraint and box constraints. We are interested in solving problems where the number of variables is so huge that basic operations, such as the evaluation of the objective function or the updating of its gradient, are very time consuming. Thus, for the considered class of problems (including dense quadratic programs), traditional optimization methods cannot be applied directly. In this paper, we define a decomposition algorithm model which employs, at each iteration, a descent search direction selected among a suitable set of sparse feasible directions. The algorithm is characterized by an acceptance rule of the updated point which on the one hand permits to choose the variables to be modified with a certain degree of freedom and on the other hand does not require the exact solution of any subproblem. The global convergence of the algorithm model is proved by assuming that the objective function is continuously differentiable and that the points of the level set have at least one component strictly between the lower and upper bounds. Numerical results on large-scale quadratic problems arising in the training of support vector machines show the effectiveness of an implemented decomposition scheme derived from the general algorithm model. [ABSTRACT FROM AUTHOR]

In engineering applications, the singularity, and the forward and inverse displacement of spatial parallel manipulators have received a great deal of attention. This paper presents a new simple but effective methodology to investigate these problems based on the analysis of the degree of freedom (DoF) of the spatial parallel manipulator. Through numerical method, the singularity and the forward displacement problems can be cracked simultaneously. With a numerical example, we point out that the Newton-GMRES algorithm is quite a good redeeming method to solve the forward displacement of spatial parallel manipulators, in which cases the differential coefficient matrix of the Newton−Raphson method is nearly singular. [ABSTRACT FROM AUTHOR]

In the late 1980s it was shown that juggling patterns can be described by strings of numbers with fascinating combinatorial properties that have since then been studied by many mathematicians and computer scientists. In this paper we propose to study juggling patterns from a pattern matching point of view. Inspired by pattern matching algorithms based on convolution, we propose a fast algorithm for finding transitions between juggling states. Apart from being a fun application of pattern matching theory, it provides a practical tool in the experimental design of (large) juggling patterns. We also provide a compact formula for counting the number of transitions of a given length between two juggling states. [ABSTRACT FROM AUTHOR]

Eye disease is a major health problem among the elderly people. Cataract and corneal arcus are the major abnormalities that exist in the anterior segment eye region of aged people. Hence, computer-aided diagnosis of anterior segment eye abnormalities will be helpful for mass screening and grading in ophthalmology. In this paper, we propose a multiclass computer-aided diagnosis (CAD) system using visible wavelength (VW) eye images to diagnose anterior segment eye abnormalities. In the proposed method, the input VW eye images are pre-processed for specular reflection removal and the iris circle region is segmented using a circular Hough Transform (CHT)-based approach. The first-order statistical features and wavelet-based features are extracted from the segmented iris circle and used for classification. The Support Vector Machine (SVM) by Sequential Minimal Optimization (SMO) algorithm was used for the classification. In experiments, we used 228 VW eye images that belong to three different classes of anterior segment eye abnormalities. The proposed method achieved a predictive accuracy of 96.96% with 97% sensitivity and 99% specificity. The experimental results show that the proposed method has significant potential for use in clinical applications. [ABSTRACT FROM AUTHOR]