scholarly journals Exact Computation of Maximum Rank Correlation Estimator

2021 ◽  
Author(s):  
Youngki Shin ◽  
Zvezdomir Todorov

Abstract In this paper we provide a computation algorithm to get a global solution for the maximum rank correlation estimator using the mixed integer programming (MIP) approach. We construct a new constrained optimization problem by transforming all indicator functions into binary parameters to be estimated and show that it is equivalent to the original problem. We also consider an application of the best subset rank prediction and show that the original optimization problem can be reformulated as MIP. We derive the non-asymptotic bound for the tail probability of the predictive performance measure. We investigate the performance of the MIP algorithm by an empirical example and Monte Carlo simulations.

Author(s):  
Rei Nakamichi ◽  
Toshiaki Taoka ◽  
Hisashi Kawai ◽  
Tadao Yoshida ◽  
Michihiko Sone ◽  
...  

Abstract Purpose To identify magnetic resonance cisternography (MRC) imaging findings related to Gadolinium-based contrast agent (GBCA) leakage into the subarachnoid space. Materials and methods The number of voxels of GBCA leakage (V-leak) on 3D-real inversion recovery images was measured in 56 patients scanned 4 h post-intravenous GBCA injection. Bridging veins (BVs) were identified on MRC. The numbers of BVs with surrounding cystic structures (BV-cyst), with arachnoid granulations protruding into the superior sagittal sinus (BV-AG-SSS) and the skull (BV-AG-skull), and including any of these factors (BV-incl) were recorded. Correlations between these variables and V-leak were examined based on the Spearman’s rank correlation coefficient. Receiver-operating characteristic (ROC) curves were generated to investigate the predictive performance of GBCA leakage. Results V-leak and the number of BV-incl were strongly correlated (r = 0.609, p < 0.0001). The numbers of BV-cyst and BV-AG-skull had weaker correlations with V-leak (r = 0.364, p = 0.006; r = 0.311, p = 0.020, respectively). The number of BV-AG-SSS was not correlated with V-leak. The ROC curve for contrast leakage exceeding 1000 voxels and the number of BV-incl had moderate accuracy, with an area under the curve of 0.871. Conclusion The number of BV-incl may be a predictor of GBCA leakage and a biomarker for waste drainage function without using GBCA.


Author(s):  
Tianqi Jing ◽  
Shiwen He ◽  
Fei Yu ◽  
Yongming Huang ◽  
Luxi Yang ◽  
...  

AbstractCooperation between the mobile edge computing (MEC) and the mobile cloud computing (MCC) in offloading computing could improve quality of service (QoS) of user equipments (UEs) with computation-intensive tasks. In this paper, in order to minimize the expect charge, we focus on the problem of how to offload the computation-intensive task from the resource-scarce UE to access point’s (AP) and the cloud, and the density allocation of APs’ at mobile edge. We consider three offloading computing modes and focus on the coverage probability of each mode and corresponding ergodic rates. The resulting optimization problem is a mixed-integer and non-convex problem in the objective function and constraints. We propose a low-complexity suboptimal algorithm called Iteration of Convex Optimization and Nonlinear Programming (ICONP) to solve it. Numerical results verify the better performance of our proposed algorithm. Optimal computing ratios and APs’ density allocation contribute to the charge saving.


2021 ◽  
Vol 5 (1) ◽  
Author(s):  
Orhun Utku Aydin ◽  
Abdel Aziz Taha ◽  
Adam Hilbert ◽  
Ahmed A. Khalil ◽  
Ivana Galinovic ◽  
...  

AbstractAverage Hausdorff distance is a widely used performance measure to calculate the distance between two point sets. In medical image segmentation, it is used to compare ground truth images with segmentations allowing their ranking. We identified, however, ranking errors of average Hausdorff distance making it less suitable for applications in segmentation performance assessment. To mitigate this error, we present a modified calculation of this performance measure that we have coined “balanced average Hausdorff distance”. To simulate segmentations for ranking, we manually created non-overlapping segmentation errors common in magnetic resonance angiography cerebral vessel segmentation as our use-case. Adding the created errors consecutively and randomly to the ground truth, we created sets of simulated segmentations with increasing number of errors. Each set of simulated segmentations was ranked using both performance measures. We calculated the Kendall rank correlation coefficient between the segmentation ranking and the number of errors in each simulated segmentation. The rankings produced by balanced average Hausdorff distance had a significantly higher median correlation (1.00) than those by average Hausdorff distance (0.89). In 200 total rankings, the former misranked 52 whilst the latter misranked 179 segmentations. Balanced average Hausdorff distance is more suitable for rankings and quality assessment of segmentations than average Hausdorff distance.


1999 ◽  
Author(s):  
David M. Paulus ◽  
Richard A. Gaggioli ◽  
William R. Dunbar

Abstract It is proposed that consideration be given to an alternative, streamlined manner for mathematical modeling of the performance of energy conversion and transfer equipment. We make the case, here, by application to compressors. It is advocated that, instead of using an expression for efficiency as one of the governing equations, performance can be accounted for directly, with entropy production. It is shown that (1) the modeling is more straightforward, using fewer relations, and (2) that compressor performance (e.g. maps) can be represented equally well.


Author(s):  
LianZheng Ge ◽  
Jian Chen ◽  
Ruifeng Li ◽  
Peidong Liang

Purpose The global performance of industrial robots partly depends on the properties of drive system consisting of motor inertia, gearbox inertia, etc. This paper aims to deal with the problem of optimization of global dynamic performance for robotic drive system selected from available components. Design/methodology/approach Considering the performance specifications of drive system, an optimization model whose objective function is composed of working efficiency and natural frequency of robots is proposed. Meanwhile, constraints including the rated and peak torque of motor, lifetime of gearbox and light-weight were taken into account. Furthermore, the mapping relationship between discrete optimal design variables and component properties of drive system were presented. The optimization problem with mixed integer variables was solved by a mixed integer-laplace crossover power mutation algorithm. Findings The optimization results show that our optimization model and methods are applicable, and the performances are also greatly promoted without sacrificing any constraints of drive system. Besides, the model fits the overall performance well with respect to light-weight ratio, safety, cost reduction and others. Practical implications The proposed drive system optimization method has been used for a 4-DOF palletizing robot, which has been largely manufactured in a factory. Originality/value This paper focuses on how the simulation-based optimization can be used for the purpose of generating trade-offs between cost, performance and lifetime when designing robotic drive system. An applicable optimization model and method are proposed to handle the dynamic performance optimization problem of a drive system for industrial robot.


1999 ◽  
Vol 62 (3) ◽  
pp. 279-285 ◽  
Author(s):  
Jason Abrevaya

2021 ◽  
Author(s):  
Linh Nguyen

<pre>The paper addresses the problem of efficiently planning routes for multiple ground vehicles used in goods delivery services. Given popularity of today's e-commerce, particularly under the COVID-19 pandemic conditions, goods delivery services have been booming than ever, dominated by small-scaled (electric) bikes and promised by autonomous vehicles. However, finding optimal routing paths for multiple delivery vehicles operating simultaneously in order to minimize transportation cost is a fundamental but challenging problem. In this paper, it is first proposed to exploit the mixed integer programming paradigm to model the delivery routing optimization problem (DROP) for multiple simultaneously-operating vehicles given their energy constraints. The routing optimization problem is then solved by the multi-chromosome genetic algorithm, where the number of delivery vehicles can be optimized. The proposed approach was evaluated in a real-world experiment in which goods were expected to be delivered from a depot to 26 suburb locations in Canberra, Australia. The obtained results demonstrate effectiveness of the proposed algorithm.</pre>


F1000Research ◽  
2014 ◽  
Vol 2 ◽  
pp. 71 ◽  
Author(s):  
Erik Olofsen ◽  
Albert Dahan

Akaike's information theoretic criterion for model discrimination (AIC) is often stated to "overfit", i.e., it selects models with a higher dimension than the dimension of the model that generated the data. However, with experimental pharmacokinetic data it may not be possible to identify the correct model, because of the complexity of the processes governing drug disposition. Instead of trying to find the correct model, a more useful objective might be to minimize the prediction error of drug concentrations in subjects with unknown disposition characteristics. In that case, the AIC might be the selection criterion of choice.We performed Monte Carlo simulations using a model of pharmacokinetic data (a power function of time) with the property that fits with common multi-exponential models can never be perfect - thus resembling the situation with real data. Prespecified models were fitted to simulated data sets, and AIC and AICc (the criterion with a correction for small sample sizes) values were calculated and averaged. The average predictive performances of the models, quantified using simulated validation sets, were compared to the means of the AICs. The data for fits and validation consisted of 11 concentration measurements each obtained in 5 individuals, with three degrees of interindividual variability in the pharmacokinetic volume of distribution.Mean AICc corresponded very well, and better than mean AIC, with mean predictive performance. With increasing interindividual variability, there was a trend towards larger optimal models, but with respect to both lowest AICc and best predictive performance. Furthermore, it was observed that the mean square prediction error itself became less suitable as a validation criterion, and that a predictive performance measure should incorporate interindividual variability.This simulation study showed that, at least in a relatively simple mixed effects modelling context with a set of prespecified models, minimal mean AICc corresponded to best predictive performance even in the presence of relatively large interindividual variability.


Author(s):  
Lei Xu ◽  
Tsan Sheng (Adam) Ng ◽  
Alberto Costa

In this paper, we develop a distributionally robust optimization model for the design of rail transit tactical planning strategies and disruption tolerance enhancement under downtime uncertainty. First, a novel performance function evaluating the rail transit disruption tolerance is proposed. Specifically, the performance function maximizes the worst-case expected downtime that can be tolerated by rail transit networks over a family of probability distributions of random disruption events given a threshold commuter outflow. This tolerance function is then applied to an optimization problem for the planning design of platform downtime protection and bus-bridging services given budget constraints. In particular, our implementation of platform downtime protection strategy relaxes standard assumptions of robust protection made in network fortification and interdiction literature. The resulting optimization problem can be regarded as a special variation of a two-stage distributionally robust optimization model. In order to achieve computational tractability, optimality conditions of the model are identified. This allows us to obtain a linear mixed-integer reformulation that can be solved efficiently by solvers like CPLEX. Finally, we show some insightful results based on the core part of Singapore Mass Rapid Transit Network.


Sign in / Sign up

Export Citation Format

Share Document