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]

In this comment on the discussion paper "The power of monitoring: how to make the most of a contaminated multivariate sample" by A. Cerioli, M. Riani, A. Atkinson and A. Corbellini, we describe how the hard rejection property of the MCD method can be mimicked by an S-estimator with appropriate rho-function. We also point the reader to fast and deterministic algorithms for the MCD, S- and MM-estimators that are specifically suited for monitoring experiments. They were made available a few years ago and successfully used for monitoring in our papers. Finally, the question is raised how monitoring can be applied or extended for increasing numbers of cases, variables and tuning parameters. [ABSTRACT FROM AUTHOR]

An automated diagnosis system is crucial for helping radiologists identify brain abnormalities efficiently. The convolutional neural network (CNN) algorithm of deep learning has the advantage of automated feature extraction beneficial for an automated diagnosis system. However, several challenges in the CNN-based classifiers of medical images, such as a lack of labeled data and class imbalance problems, can significantly hinder the performance. Meanwhile, the expertise of multiple clinicians may be required to achieve accurate diagnoses, which can be reflected in the use of multiple algorithms. In this paper, we present Deep-Stacked CNN, a deep heterogeneous model based on stacked generalization to harness the advantages of different CNN-based classifiers. The model aims to improve robustness in the task of multi-class brain disease classification when we have no opportunity to train single CNNs on sufficient data. We propose two levels of learning processes to obtain the desired model. At the first level, different pre-trained CNNs fine-tuned via transfer learning will be selected as the base classifiers through several procedures. Each base classifier has a unique expert-like character, which provides diversity to the diagnosis outcomes. At the second level, the base classifiers are stacked together through neural network, representing the meta-learner that best combines their outputs and generates the final prediction. The proposed Deep-Stacked CNN obtained an accuracy of 99.14% when evaluated on the untouched dataset. This model shows its superiority over existing methods in the same domain. It also requires fewer parameters and computations while maintaining outstanding performance. [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 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]

In recent years, there has been a growing interest for the experimental analysis in the field of evolutionary algorithms. It is noticeable due to the existence of numerous papers which analyze and propose different types of problems, such as the basis for experimental comparisons of algorithms, proposals of different methodologies in comparison or proposals of use of different statistical techniques in algorithms’ comparison. In this paper, we focus our study on the use of statistical techniques in the analysis of evolutionary algorithms’ behaviour over optimization problems. A study about the required conditions for statistical analysis of the results is presented by using some models of evolutionary algorithms for real-coding optimization. This study is conducted in two ways: single-problem analysis and multiple-problem analysis. The results obtained state that a parametric statistical analysis could not be appropriate specially when we deal with multiple-problem results. In multiple-problem analysis, we propose the use of non-parametric statistical tests given that they are less restrictive than parametric ones and they can be used over small size samples of results. As a case study, we analyze the published results for the algorithms presented in the CEC’2005 Special Session on Real Parameter Optimization by using non-parametric test procedures. [ABSTRACT FROM AUTHOR]

There have been large attempts to adopt the bias-variance framework from the regression problems to the classification problems. However, recently, it has been shown that only non-straightforward extensions exist for classification problems. In this paper, we present an alternative visualization framework for classification problems called zone analysis. Our zone analysis framework partly extends the bias-variance idea; instead of decomposing an error into two parts, i.e. the biased and unbiased components, our framework decomposes the error into K components. While bias-variance information is still contained in our framework, our framework provides interesting observations which are not obviously seen in the previous bias-variance framework, e.g. a prejudice behavior of the bagging algorithm to various unbiased instances. Our framework is suitable for visualizing an effect of context changes on learning performance. The type of context changes which we primarily investigate in the paper is “a change from a base learner to an ensemble learner such as bagging, adaboost, arc-x4 and multi-boosting”. [ABSTRACT FROM AUTHOR]

The general mean-semivariance portfolio optimization problem seeks to determine the efficient frontier by solving a parametric non-quadratic programming problem. In this paper it is shown how to transform this problem into a general mean-variance optimization problem, hence the Critical Line Algorithm is applicable. This paper also discusses how to implement the critical line algorithm to save storage and reduce execution time. [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]

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]

When search methods are being designed it is very important to know which parameters have the greatest influence on the behaviour and performance of the algorithm. To this end, algorithm parameters are commonly calibrated by means of either theoretic analysis or intensive experimentation. When undertaking a detailed statistical analysis of the influence of each parameter, the designer should pay attention mostly to the parameters that are statistically significant. In this paper the ANOVA (ANalysis Of the VAriance) method is used to carry out an exhaustive analysis of a simulated annealing based method and the different parameters it requires. Following this idea, the significance and relative importance of the parameters regarding the obtained results, as well as suitable values for each of these, were obtained using ANOVA and post-hoc Tukey HSD test, on four well known function optimization problems and the likelihood function that is used to estimate the parameters involved in the lognormal diffusion process. Through this statistical study we have verified the adequacy of parameter values available in the bibliography using parametric hypothesis tests. [ABSTRACT FROM AUTHOR]

The images generated in modern IC laboratories are created with high-quality standard (1,024 × 1,024 pixels and 10-12 bits/pixel) enabling cardiologists to perform interventions in the best conditions. But these images are in most of the cases archived in a basic quality standard (512 × 512 pixels and 8 bits/pixel). The purpose of this work is to complete the research developed in a previous paper and analyze the influence of the matrix size and the bit depth reduction on the image quality acquired on a polymethylmethacrylate (PMMA) phantom with a test object. The variation in contrast-to-noise ratio (CNR) and high contrast spatial resolution (HCSR) were investigated when the matrix size and the bit depth were independently modified for different phantom thicknesses. These two image quality parameters did not suffer noticeable alterations under bits depth reduction from 10 to 8 bits. Such a result seems to imply that bits depth reduction could be used to reduce file sizes with a suitable algorithm and without losing perceptible image quality information. But when the matrix size was reduced from 1,024 × 1,024 to 512 × 512 pixels, a reduction from 17% to 25% in HCSR was noticed when changing phantom thickness, and an increase of 27% in CNR was observed. These findings should be taken into account and it would be wise to conduct further investigations in the field of clinical images. [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 proposes an efficient hybrid approach for solving multi-objective optimization design of a compliant mechanism. The approach is developed by integrating desirability function approach, fuzzy logic system, adaptive neuro-fuzzy inference system, and Lightning attachment procedure optimization. Box–Behnken design is used to form a numerically experimental matrix. First, a refinement of design variables is conducted through analysis of variance and Taguchi approach in terms of considerably eliminating space of design variables and computation efforts. Next, desirability of two objective functions is computed and transferred into the fuzzy logic system. The output of fuzzy logic system is regarded as single combined objective function. Subsequently, a modeling for fuzzy output is developed via adaptive neuro-fuzzy inference system. Then, LAPO algorithm is adopted for solving the optimization problem. By investigating three different numerical examples, performance of the proposed approach is validated. Numerical results revealed that the proposed approach has a computational accuracy better than that of Taguchi-based fuzzy logic reasoning. Finally, case study 1 is chosen as an optimal solution for the mechanism. Furthermore, the effectiveness of proposed approach is greater than that of the Jaya algorithm and TLBO algorithm through Wilcoxon signed rank test and Friedman test. The proposed approach can be used for related engineering fields. [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]

Closed multiclass separable queueing networks can in principle be analyzed using exact computational algorithms. This, however, may not be feasible in the case of large networks. As a result, much work has been devoted to developing approximation techniques, most of which is based on heuristic extensions of the mean value analysis (MVA) algorithm. In this paper, we propose an alternative approximation method to analyze large separable networks. This method is based on an approximation method for non-separable networks recently proposed by Baynat and Dallery. We show how this method can be efficiently used to analyze large separable networks. It is especially of interest when dealing with networks having multiple-server stations. Numerical results show that this method has good accuracy. [ABSTRACT FROM AUTHOR]

The minimum-norm point problem which arises in portfolio selections is discussed and an interior point algorithm to solve the problem is proposed in this paper. Three kinds of problems, the mean-variance, the index matching and the multiple factor models are viewed as variants of the minimum-norm point problem. Results of the computational experiments are attached to show the proposed algorithm as a very powerful tool for large scale portfolio optimization. [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]

When conducting recurrent event data analysis, it is common to assume that the covariate processes are observed throughout the follow-up period. In most applications, however, the values of time-varying covariates are only observed periodically rather than continuously. A popular ad-hoc approach is to carry forward the last observed covariate value until it is measured again. This simple approach, however, usually leads to biased estimation. To tackle this problem, we propose to model the covariate effect on the risk of the recurrent events through jointly modeling the recurrent event process and the longitudinal measures. Despite its popularity, estimation of the joint model with binary longitudinal measurements remains a challenge, because the standard linear mixed effects model approach is not appropriate for binary measures. In this paper, we postulate a Markov model for the binary covariate process and a random-effect proportional intensity model for the recurrent event process. We use a Markov chain Monte Carlo algorithm to estimate all the unknown parameters. The performance of the proposed estimator is evaluated via simulations. The methodology is applied to an observational study designed to evaluate the effect of Group A streptococcus on pharyngitis among school children in India. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a new class of multivariate distributions as an extension of the normal variance-mean mixture distributions class. The new class results from a variance-mean mixture of the skew normal and the generalized inverse Gaussian distributions. The new class is very flexible in terms of heavy tails and skewness and many of the widely used distributions, such as generalized hyperbolic, skew t, and skew Laplace distributions are included as special or limiting cases of the new class. An explicit expression for the density function of the new class is given and some of its distributional properties, such as moment generating function, linear transformations, quadratic forms, marginal and conditional distributions are examined. We give a simulation algorithm to generate random variates from the new class and propose an EM algorithm for maximum likelihood estimation of its parameters. We provide some examples to demonstrate the modeling strength of the proposed class. [ABSTRACT FROM AUTHOR]

Preterm birth (PTB) is the leading cause of infant mortality globally. Research has focused on developing predictive models for PTB without prioritizing cost-effective interventions. Physical activity and sleep present unique opportunities for interventions in low- and middle-income populations (LMICs). However, objective measurement of physical activity and sleep remains challenging and self-reported metrics suffer from low-resolution and accuracy. In this study, we use physical activity data collected using a wearable device comprising over 181,944 h of data across N = 1083 patients. Using a new state-of-the art deep learning time-series classification architecture, we develop a 'clock' of healthy dynamics during pregnancy by using gestational age (GA) as a surrogate for progression of pregnancy. We also develop novel interpretability algorithms that integrate unsupervised clustering, model error analysis, feature attribution, and automated actigraphy analysis, allowing for model interpretation with respect to sleep, activity, and clinical variables. Our model performs significantly better than 7 other machine learning and AI methods for modeling the progression of pregnancy. We found that deviations from a normal 'clock' of physical activity and sleep changes during pregnancy are strongly associated with pregnancy outcomes. When our model underestimates GA, there are 0.52 fewer preterm births than expected (P = 1.01e − 67, permutation test) and when our model overestimates GA, there are 1.44 times (P = 2.82e − 39, permutation test) more preterm births than expected. Model error is negatively correlated with interdaily stability (P = 0.043, Spearman's), indicating that our model assigns a more advanced GA when an individual's daily rhythms are less precise. Supporting this, our model attributes higher importance to sleep periods in predicting higher-than-actual GA, relative to lower-than-actual GA (P = 1.01e − 21, Mann-Whitney U). Combining prediction and interpretability allows us to signal when activity behaviors alter the likelihood of preterm birth and advocates for the development of clinical decision support through passive monitoring and exercise habit and sleep recommendations, which can be easily implemented in LMICs. [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]

In this paper, an automatic computer-aided detection system for breast magnetic resonance imaging (MRI) tumour segmentation will be presented. The study is focused on tumour segmentation using the modified automatic seeded region growing algorithm with a variation of the automated initial seed and threshold selection methodologies. Prior to that, some pre-processing methodologies are involved. Breast skin is detected and deleted using the integration of two algorithms, namely the level set active contour and morphological thinning. The system is applied and tested on 40 test images from the RIDER breast MRI dataset, the results are evaluated and presented in comparison to the ground truths of the dataset. The analysis of variance (ANOVA) test shows that there is a statistically significance in the performance compared to the previous segmentation approaches that have been tested on the same dataset where ANOVA p values for the evaluation measures' results are less than 0.05, such as: relative overlap ( p = 0.0002), misclassification rate ( p = 0.045), true negative fraction ( p = 0.0001) and sum of true volume fraction ( p = 0.0001). [ABSTRACT FROM AUTHOR]

Advances in computer technologies have enabled corporations to accumulate data at an unprecedented speed. Large-scale business data might contain billions of observations and thousands of features, which easily brings their scale to the level of terabytes. Most traditional feature selection algorithms are designed and implemented for a centralized computing architecture. Their usability significantly deteriorates when data size exceeds tens of gigabytes. High-performance distributed computing frameworks and protocols, such as the Message Passing Interface (MPI) and MapReduce, have been proposed to facilitate software development on grid infrastructures, enabling analysts to process large-scale problems efficiently. This paper presents a novel large-scale feature selection algorithm that is based on variance analysis. The algorithm selects features by evaluating their abilities to explain data variance. It supports both supervised and unsupervised feature selection and can be readily implemented in most distributed computing environments. The algorithm was implemented as a SAS High-Performance Analytics procedure, which can read data in distributed form and perform parallel feature selection in both symmetric multiprocessing mode (SMP) and massively parallel processing mode (MPP). Experimental results demonstrated the superior performance of the proposed method for large scale feature selection. [ABSTRACT FROM AUTHOR]

In clinical diagnosis of nasopharyngeal carcinoma (NPC) lesion, clinicians are often required to delineate boundaries of NPC on a number of tumor-bearing magnetic resonance images, which is a tedious and time-consuming procedure highly depending on expertise and experience of clinicians. Computer-aided tumor segmentation methods (either contour-based or region-based) are necessary to alleviate clinicians' workload. For contour-based methods, a minimal user interaction to draw an initial contour inside or outside the tumor lesion for further curve evolution to match the tumor boundary is preferred, but parameters within most of these methods require manual adjustment, which is technically burdensome for clinicians without specific knowledge. Therefore, segmentation methods with a minimal user interaction as well as automatic parameters adjustment are often favored in clinical practice. In this paper, two region-based methods with parameters learning are introduced for NPC segmentation. Two hundred fifty-three MRI slices containing NPC lesion are utilized for evaluating the performance of the two methods, as well as being compared with other similar region-based tumor segmentation methods. Experimental results demonstrate the superiority of adopting learning in the two introduced methods. Also, they achieve comparable segmentation performance from a statistical point of view. [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]

Sasabuchi et al. (Biometrika 70(2):465-472, 1983) introduces a multivariate version of the well-known univariate isotonic regression which plays a key role in the field of statistical inference under order restrictions. His proposed algorithm for computing the multivariate isotonic regression, however, is guaranteed to converge only under special conditions (Sasabuchi et al., J Stat Comput Simul 73(9):619-641, 2003). In this paper, a more general framework for multivariate isotonic regression is given and an algorithm based on Dykstra's method is used to compute the multivariate isotonic regression. Two numerical examples are given to illustrate the algorithm and to compare the result with the one published by Fernando and Kulatunga (Comput Stat Data Anal 52:702-712, 2007). [ABSTRACT FROM AUTHOR]

The main contribution of this paper is to provide a classification of disturbance vectors used in differential collision attacks against $${\tt{SHA}-1}$$ . We show that all published disturbance vectors can be classified into two types of vectors, type-I and type-II. We present a deterministic algorithm which produce efficient disturbance vectors with respect to any given cost function. We define two simple cost functions to evaluate the efficiency of a candidate disturbance vector. Using our algorithm and those cost function we retrieved all previously known vectors and found that the most efficient disturbance vector is the one first reported as Codeword2 by Jutla and Patthak, A matching lower bound on the minimum weight of SHA-1 expansion code. Cryptology ePrint Archive, Report 2005/266, (). We also present a statistical evaluation of local collisions' holding probabilities and show that the common assumption of local collision independence is flawed. [ABSTRACT FROM AUTHOR]

This paper introduces a robust variant of AdaBoost, cw-AdaBoost, that uses weight perturbation to reduce variance error, and is particularly effective when dealing with data sets, such as microarray data, which have large numbers of features and small number of instances. The algorithm is compared with AdaBoost, Arcing and MultiBoost, using twelve gene expression datasets, using 10-fold cross validation. The new algorithm consistently achieves higher classification accuracy over all these datasets. In contrast to other AdaBoost variants, the algorithm is not susceptible to problems when a zero-error base classifier is encountered. [ABSTRACT FROM AUTHOR]

The goal of this paper is to introduce a partially adaptive estimator for the grouped-data regression model based on an error structure described by a mixture of two normal distributions. The model we introduce is easily estimated by maximum likelihood using the EM algorithm adapted from the work of Bartolucci and Scaccia (Comput Stat Data Anal 48:821–834, 2005). The partially adaptive estimator is applied to data used by Long and Caudill (Rev Econ Stat 73:525–531, 1991) to examine the impact of intercollegiate athletics on income. We estimate a variation of the original regression model and find that there is a considerable financial advantage for those male athletes now working in business management. This finding is consistent with the idea that athletes acquire team-building and organizational skills that are helpful in business. [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]

This paper proposes to determine a sufficient number of images for reliable classification and to use feature selection to select most relevant features for achieving reliable steganalysis. First dimensionality issues in the context of classification are outlined, and the impact of the different parameters of a steganalysis scheme (the number of samples, the number of features, the steganography method, and the embedding rate) is studied. On one hand, it is shown that, using Bootstrap simulations, the standard deviation of the classification results can be very important if too small training sets are used; moreover a minimum of 5000 images is needed in order to perform reliable steganalysis. On the other hand, we show how the feature selection process using the OP-ELM classifier enables both to reduce the dimensionality of the data and to highlight weaknesses and advantages of the six most popular steganographic algorithms. [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]

This paper presents a closed form solution of the mean-variance portfolio selection problem for uncorrelated assets that precludes short sells. We also study the problem with the consideration of transaction cost. When the asset holding can be explicitly become available, one can have a better understanding of the behavior of efficient frontier. Our algorithm solves the mean-variance portfolio selection with uncorrelated risky assets plus one risk free asset. The algorithm is based on a continuous dynamic programming and provides a general closed form solution that is a function of expected returns and variances of all assets. The implementation of the algorithm is presented by some practical examples. [ABSTRACT FROM AUTHOR]

In this paper, we present a capacity analysis of an automated transportation system in a flexible assembly factory. The transportation system, together with the workstations, is modeled as a network of queues with multiple job classes. Due to its complex nature, the steady-state behavior of this network is not described by a product-form solution. Therefore, we present an approximate method to determine the capacity of the network. We first study a number of key elements of the system separately and subsequently combine the results of this analysis in an Approximate Mean Value Analysis (AMVA) algorithm. The key elements are a buffer/transfer system (the bottleneck of the system), modeled as a preemptive-repeat priority queue with identical deterministic service times for the different job classes, a set of elevators, modeled as vacation servers, a number of work cells, modeled as multiserver queues, and several non-accumulating conveyor belts, modeled as ample servers. The AMVA algorithm exploits the property that the initial multi-class queueing network can be decomposed into a sequence of single-class queueing networks and hence is very efficient. Comparison of numerical results of the AMVA algorithm for the throughputs for the different job classes to simulation results shows that the AMVA algorithm is also accurate. For several series of instances, the maximum relative error that we found was only 4.0%. [ABSTRACT FROM AUTHOR]

In this paper, stochastic programming techniques are adapted and further developed for applications to discrete event systems. We consider cases where the sample path of the system depends discontinuously on control parameters (e.g. modeling of failures, several competing processes), which could make the computation of estimates of the gradient difficult. Methods which use only samples of the performance criterion are developed, in particular finite differences with reduced variance and concurrent approximation and optimization algorithms. Optimization of the stationary behavior is also considered. Results of numerical experiments and convergence results are reported. [ABSTRACT FROM AUTHOR]

Multipath interference seriously degrades the performance of Global Navigation Satellite System (GNSS) positioning in an urban canyon. Most current multipath mitigation algorithms suffer from heavy computational load or need external assistance. We propose a multipath mitigation algorithm based on the steepest descent approach, which has the merits of less computational load and no need for external aid. A new ranging code tracking loop is designed based on the steepest descent method, which can save an early branch or a late branch compared with the narrow-spacing correlation method. The power of the Non-Line-of-Sight (NLOS) signal is weaker than that of the Line-of-Sight (LOS) signal when the LOS signal is not obstructed and with a relatively high Carrier Noise Ratio (CNR). The peak position in the X-axis of the ranging code autocorrelation function does not move with the NLOS interference. Meanwhile, the cost function is designed according to this phenomenon. The results demonstrate that the proposed algorithm outperforms the narrow-spacing correlation and the Multipath Estimated Delay Locked Loop (MEDLL) in terms of the code multipath mitigation and computation time. The Standard Deviation (STD) of the tracking error with the proposed algorithm is less than 0.016 chips. Moreover, the computation time of the proposed algorithm in a software defined receiver is shortened by 24.21% compared with the narrow-spacing correlation. [ABSTRACT FROM AUTHOR]

The article presents a study that describes the specialized compression algorithm EDLZW for efficient electrocardiograph data transmission. Topics include medical information system, wireless communication, compression ratio, system architecture of ECG monitoring system, medical data, and health data.

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]

Abstract??For semiparametric models, interval estimation and hypothesis testing based on the information matrix for the full model is a challenge because of potentially unlimited dimension. Use of the profile information matrix for a small set of parameters of interest is an appealing alternative. Existing approaches for the estimation of the profile information matrix are either subject to the curse of dimensionality, or are ad-hoc and approximate and can be unstable and numerically inefficient. We propose a numerically stable and efficient algorithm that delivers an exact observed profile information matrix for regression coefficients for the class of Nonlinear Transformation Models [A. Tsodikov (2003) J R Statist Soc Ser B 65:759?774]. The algorithm deals with the curse of dimensionality and requires neither large matrix inverses nor explicit expressions for the profile surface. [ABSTRACT FROM AUTHOR]

A new nonparametric graphical test of significance of a covariate in functional GLM is proposed. Our approach is especially interesting due to its functional graphical interpretation of the results. As such, it is able to find not only if the factor of interest is significant but also which functional domain is responsible for the potential rejection. In the case of functional multi-way main effect ANOVA or functional main effect ANCOVA models it is able to find which groups differ (and where they differ), in the case of functional factorial ANOVA or functional factorial ANCOVA models it is able to find which combination of levels (which interactions) differ (and where they differ). The described tests are extensions of global envelope tests in the GLM models. It applies Freedman-Lane algorithm for the permutation of functions, and as such, it approximately achieves the desired significance level. [ABSTRACT FROM AUTHOR]

Purpose: Large inter-individual differences in warfarin maintenance dose are mostly due to the effect of genetic polymorphisms in multiple genes, including vitamin K epoxide reductase complex 1 (VKORC1), cytochromes P450 2C9 (CYP2C9), and cytochrome P450 4F2 (CYP4F2). Thus, several algorithms for predicting the warfarin dose based on pharmacogenomics data with clinical characteristics have been proposed. Although these algorithms consider these genetic polymorphisms, the formulas have different coefficient values that are critical in this context. In this study, we assessed the mutual validity among these algorithms by specifically considering racial differences. Methods: Clinical data including actual warfarin dose (AWD) of 125 Japanese patients from our previous study (Eur J Clin Pharmacol 65(11):1097–1103, 2009) were used as registered data that provided patient characteristics, including age, sex, height, weight, and concomitant medications, as well as the genotypes of CYP2C9 and VKORC1. Genotyping for CYP4F2*3 was performed by the PCR method. Five algorithms that included these factors were selected from peer-reviewed articles. The selection covered four populations, Japanese, Chinese, Caucasian, and African-American, and the International Warfarin Pharmacogenetics Consortium (IWPC). Results: For each algorithm, we calculated individual warfarin doses for 125 subjects and statistically evaluated its performance. The algorithm from the IWPC had the statistically highest correlation with the AWD. Importantly, the calculated warfarin dose (CWD) using the algorithm from African-Americans was less correlated with the AWD as compared to those using the other algorithms. The integration of CYP4F2 data into the algorithm did not improve the prediction accuracy. Conclusion: The racial difference is a critical factor for warfarin dose predictions based on pharmacogenomics. [ABSTRACT FROM AUTHOR]

Multiple true-false (MTF) items are a widely used supplement to the commonly used single-best answer (Type A) multiple choice format. However, an optimal scoring algorithm for MTF items has not yet been established, as existing studies yielded conflicting results. Therefore, this study analyzes two questions: What is the optimal scoring algorithm for MTF items regarding reliability, difficulty index and item discrimination? How do the psychometric characteristics of different scoring algorithms compare to those of Type A questions used in the same exams? We used data from 37 medical exams conducted in 2015 (998 MTF and 2163 Type A items overall). Using repeated measures analyses of variance (rANOVA), we compared reliability, difficulty and item discrimination of different scoring algorithms for MTF with four answer options and Type A. Scoring algorithms for MTF were dichotomous scoring (DS) and two partial credit scoring algorithms, PS50 where examinees receive half a point if more than half of true/false ratings were marked correctly and one point if all were marked correctly, and PS1/n where examinees receive a quarter of a point for every correct true/false rating. The two partial scoring algorithms showed significantly higher reliabilities (αPS1/n = 0.75; αPS50 = 0.75; αDS = 0.70, αA = 0.72), which corresponds to fewer items needed for a reliability of 0.8 (nPS1/n = 74; nPS50 = 75; nDS = 103, nA = 87), and higher discrimination indices (rPS1/n = 0.33; rPS50 = 0.33; rDS = 0.30; rA = 0.28) than dichotomous scoring and Type A. Items scored with DS tend to be difficult (pDS = 0.50), whereas items scored with PS1/n become easy (pPS1/n = 0.82). PS50 and Type A cover the whole range, from easy to difficult items (pPS50 = 0.66; pA = 0.73). Partial credit scoring leads to better psychometric results than dichotomous scoring. PS50 covers the range from easy to difficult items better than PS1/n. Therefore, for scoring MTF, we suggest using PS50. [ABSTRACT FROM AUTHOR]

Feasibility analysis has been developed to evaluate and quantify the capability that a process can remain feasible under uncertainty of model inputs and parameters. It can be conducted during the design stage when the objective is to get a robust design which can tolerate a certain amount of variations in the process conditions. Also, it can be used after a design is fixed when the objective is to characterize its feasible region. In this work, we have extended the usage of feasibility analysis to the cases in which inherent stochasticity is existent in the model outputs. With a surrogate-based adaptive sampling framework, we have developed and compared three algorithms that are promising to make accurate predictions on the feasible regions with a limited sampling budget. Both the advantages and limitations are discussed based on the results from five benchmark problems. Finally, we apply such methods to a pharmaceutical manufacturing process and demonstrate its potential application in characterizing the design space of the process. [ABSTRACT FROM AUTHOR]

We deal with sequences of weakly dependent observations that are naturally ordered in time. Their constant mean is possibly subject to change at most once at some unknown time point. The aim is to test whether such an unknown change has occurred or not. The change point methods presented here rely on ratio type test statistics based on maxima of the cumulative sums. These detection procedures for the abrupt change in mean are also robustified by considering a general score function. The main advantage of the proposed approach is that the variance of the observations neither has to be known nor estimated. The asymptotic distribution of the test statistic under the no change null hypothesis is derived. Moreover, we prove the consistency of the test under the alternatives. A block bootstrap method is developed in order to obtain better approximations for the test's critical values. The validity of the bootstrap algorithm is shown. The results are illustrated through a simulation study, which demonstrates computational efficiency of the procedures. A practical application to real data is presented as well. [ABSTRACT FROM AUTHOR]

This study examined differences between adults with autism spectrum disorder (ASD; N = 40) and typical community volunteers (N = 25) on measures of stressful life events, perceived stress, and biological stress response (cardiovascular and cortisol reactivity) during a novel social stress task. Additional analyses examined the relationship between stress and social functioning as measured by the Social Adjustment Scale-II and the Waisman Activities of Daily Living scale. Results indicated that adults with ASD experienced significantly more stressful life events and perceived stress, and greater systolic blood pressure reactivity than typical community volunteers. Results also indicated that perceived stress and stressful life events were significantly associated with social disability. Interventions targeting stress management might improve social function in adults with ASD. [ABSTRACT FROM AUTHOR]