Preservation of transform orders under a semiparametric model and its mixture

In this paper, sufficient conditions for preservation of several transform orders under a typical family of semiparametric distributions are made. The preservation properties are developed to compare mixture semiparametric distributions. Possible applications of the achieved results to compare scale family of distributions and also compare coherent systems with dependent but identical components and series and parallel systems with randomized number of components are provided.     

Solutions of the Periodic Toda Lattice by the Projection and the Algebraic-Geometric Methods

We compare different ways to construct solutions of the periodic Toda lattice. We give two recipes that follow from the projection method and compare them with the algebraic-geometric construction of Krichever.     

Reverse lex ideals

We study reverse lex ideals in a polynomial ring, and compare their properties to those of lex ideals. In particular we provide an analogue of Green's Theorem for reverse lex ideals. We also compare the Betti numbers of strongly stable and square-free strongly stable monomial ideals to those of reverse lex ideals.     

A numerical study of variable depth KdV equations and generalizations of Camassa–Holm-like equations

In this paper we numerically study the KdV-top equation and compare it with the Boussinesq equations over uneven bottoms. We use here a finite-difference scheme that conserves a discrete energy for the fully discrete scheme. We also compare this approach with the discontinuous Galerkin method. For the equations obtained in the case of stronger nonlinearities and related to the Camassa–Holm equation, we find several finite difference schemes that conserve a discrete energy for the fully discrete scheme. Because of its accuracy for the conservation of energy, our numerical scheme is also of interest even in the simple case of flat bottoms. We compare this approach with the discontinuous Galerkin method.     

On surface radiation conditions for an ellipse

We compare several On Surface Radiation Boundary Conditions in two dimensions, for solving the Helmholtz equation exterior to an ellipse. We also introduce a new boundary condition for an ellipse based on a modal expansion in Mathieu functions. We compare the OSRC to a finite difference method.     

带干扰的两类不同风险模型的比较

本文比较了带干扰的两类不同风险模型.首先研究了在不同保费计算原理下各风险业务的相关性是如何影响保费率计算的,进而通过鞅方法推导出两类模型破产概率的Lundberg指数和Lundberg不等式,最后比较了在不同保费计算原理下两类模型的Lundberg指数的性质.     

Deformations and contractions of algebraic structures

We describe the basic notions of versal deformation theory of algebraic structures and compare it with the analytic theory. As a special case, we consider the notion of versal deformation used by Arnold. With the help of versal deformation we get a stratification of the moduli space into projective orbifolds. We compare this with Arnold’s stratification in the case of similarity of matrices. The other notion we discuss is the opposite notion of contraction.     

On Lipschitz behaviour of some generalized derivatives

The aim of the present paper is to compare various forms of stable properties of nonsmooth functions at some points. By stable property we mean the Lipschitz property of some generalized derivatives related only to the reference point. Namely we compare Lipschitz behaviour of lower Clarke derivative, lower Dini derivative and calmness of Clarke subdifferential. In this way, we continue our study of λ-stable functions.     

带有辅助信息的ROC曲线两种估计的比较

在医学研究中,常常使用受试者操作特性曲线(ROC)曲线来研究两样本的比较问题。Lloyd构造了ROC曲线的核平滑估计,并给出了其渐近偏差以及渐近标准差。此外,当还可以获悉某一处理组上的辅助信息时,Zhou,Zhou & Ma利用经验似然的方法构造了ROC曲线的核平滑经验似然估计。本文利用"亏量"这个概念比较了带有辅助信息的情况下,对核平滑经验似然估计与完全经验似然估计进行了比较。并给出了核平滑经验似然估计优于完全经验似然估计的结论,并且随着样本容量的增大,该亏量也是无限增大的。     

Measuring aggregate process performance using AHP

When one undertakes a benchmarking study, it is quite typical to collect performance data on a set of business processes from a variety of organizations. While one can compare efficiency on a process-by-process level, how can one compare the overall efficiency of one organization versus another using this process-level data? This note presents a methodology that combines tournament ranking and Analytic Hierarchy Process (AHP) approaches to create a ranking scheme that deals explicitly with missing data and ties in the tournament scheme.     

Max-plack-institut fiir mathematik

For certain classes of locally Lipschitzian functions (continuous selections, componentwise maximum functions of Cfc-mappings) we compute bounds on the entropy dimension of the set of generalized, critical values. This yields a measure of metric complexity to compare these classes. For vector valued functions we also compare different concepts of derivatives from this metric point of view. For continuous selections of differentiable functions even explicit bounds on the e-entropy of the nearly critical values of f are provided.     

A study of lattice reformulations for integer programming

Branch-and-bound for integer optimization typically uses single-variable disjunctions. Enumerative methods for integer optimization with theoretical guarantees use a non-binary search tree with general disjunctions based on lattice structure. These disjunctions are expensive to compute and challenging to implement. Here we compare two lattice reformulations that can be used to heuristically obtain general disjunctions in the original space, we develop a new lattice-based variant, and compare the derived disjunctions computationally with those produced by the algorithm of Lovász and Scarf.     

Investment decisions in the theory of finance: Some antinomies and inconsistencies

The net-present-value rule is a pillar of modern finance theory. As known, it is a capital budgeting rule. Finance theory prescribes the investor to compare the opportunity in hand with an asset of equivalent risk, i.e. to discount cash flows with a risk-adjusted rate of return. This paper aims at showing that inconsistencies and antinomies arise when applying the above-mentioned rule. Further, it turns out that it is actually impossible to compare alternatives equivalent in risk and any decision maker cannot prevent herself to violate the above tenet.     

Three methods for two‐sided bounds of eigenvalues—A comparison

We compare three finite element‐based methods designed for two‐sided bounds of eigenvalues of symmetric elliptic second order operators. The first method is known as the Lehmann–Goerisch method. The second method is based on Crouzeix–Raviart nonconforming finite element method. The third one is a combination of generalized Weinstein and Kato bounds with complementarity‐based estimators. We concisely describe these methods and use them to solve three numerical examples. We compare their accuracy, computational performance, and generality in both the lowest and higher order case.     

弹性波方程有限元模拟的曲边地表处理

本文对比研究了关于弹性波模拟中的曲边地表形状处理的两种方法,一种是用给定的实际介质数值划定的地表形状,另一种是用样条插值逼近地表形状.本文采用有限元方法进行弹性波数值模拟,给出了基于这两种方法计算的数值例子,并对结果进行了分析比较.结果表明使用后一种方法对地表进行处理时,地表人工离散产生的干扰明显减少,优于前一种方法.     

On the empirical scaling of running time for finding optimal solutions to the TSP

We study the empirical scaling of the running time required by state-of-the-art exact and inexact TSP algorithms for finding optimal solutions to Euclidean TSP instances as a function of instance size. In particular, we use a recently introduced statistical approach to obtain scaling models from observed performance data and to assess the accuracy of these models. For Concorde, the long-standing state-of-the-art exact TSP solver, we compare the scaling of the running time until an optimal solution is first encountered (the finding time) and that of the overall running time, which adds to the finding time the additional time needed to complete the proof of optimality. For two state-of-the-art inexact TSP solvers, LKH and EAX, we compare the scaling of their running time for finding an optimal solution to a given instance; we also compare the resulting models to that for the scaling of Concorde’s finding time, presenting evidence that both inexact TSP solvers show significantly better scaling behaviour than Concorde.     

Differential Characters and Multiplicative Cohomology

We compare the groups of differential characters of Cheeger and Simons to Karoobi's multiplicative cohomology.     

Binary extended formulations of polyhedral mixed-integer sets

We analyze different ways of constructing binary extended formulations of polyhedral mixed-integer sets with bounded integer variables and compare their relative strength with respect to split cuts. We show that among all binary extended formulations where each bounded integer variable is represented by a distinct collection of binary variables, what we call “unimodular” extended formulations are the strongest. We also compare the strength of some binary extended formulations from the literature. Finally, we study the behavior of branch-and-bound on such extended formulations and show that branching on the new binary variables leads to significantly smaller enumeration trees in some cases.     

On a paper of Krupchyk, Tarkhanov, and Tuomela

We compare the above-mentioned article with the content of a previous publication.     

A comprehensive method for comparing mental models of dynamic systems

Mental models are the basis on which managers make decisions even though external decision support systems may provide help. Research has demonstrated that more comprehensive and dynamic mental models seem to be at the foundation for improved policies and decisions. Eliciting and comparing such models can systematically explicate key variables and their main underlying structures. In addition, superior dynamic mental models can be identified. This paper reviews existing studies which measure and compare mental models. It shows that the methods used to compare such models lack to account for relevant aspects of dynamic systems, such as, time delays in causal links, feedback structures, and the polarities of feedback loops. Mental models without those properties are mostly static models. To overcome these limitations of the methods to compare mental models, we enhance the widely used distance ratio approach (Markóczy and Goldberg, 1995) so as to comprehend these dynamic characteristics and detect differences among mental models at three levels: the level of elements, the level of individual feedback loops, and the level of the complete model. Our contribution lies in a new method to compare explicated mental models, not to elicit such models. An application of the method shows that this previously non-existent information is essential for understanding differences between managers’ mental models of dynamic systems. Thereby, a further path is created to critically analyze and elaborate the models managers use in real world decision making. We discuss the benefits and limitations of our approach for research about mental models and decision making and conclude by identifying directions for further research for operational researchers.