非理想状态下的塔板理论模型

 在过程中 ,将流动相看成是由许多连续的塔板组成 ,每一塔板的高度与固定相塔板的高度相同。初始浓度的溶质被认为全部集中在流动相的第一塔板中 ;溶质在流动相和固定相之间动态分布。由于动力学因素的影响 ,当流动相流过一个塔板距离时 ,溶质不能够迅速地从固定相释放到流动相中 ,因此溶质在流动相和固定相中的分布浓度受到两个因素即反映系统热力学性质的分配系数P和反映系统动力学性质的释放概率因子α的影响。这一过程被认为是非理想状态下的过程。     

关于两两NQD列的若干极限性质

本文讨论了两两ＮＱＤ列的Ｍａｒｃｉｎｋｉｅｗｉｃｚ型弱大数律及Ｊａｍｉｓｏｎ型加权和的强稳定性，指出了两两ＮＱＤ列与独立列的一个本质性区别，从而提出了解决两两ＮＱＤ旬几乎处处收敛和完全收敛的一种方式。     

On a class of dependent Sparre Andersen risk models and a bailout application

In this paper a one-dimensional surplus process is considered with a certain Sparre Andersen type dependence structure under general interclaim times distribution and correlated phase-type claim sizes. The Laplace transform of the time to ruin under such a model is obtained as the solution of a fixed-point problem, under both the zero-delayed and the delayed cases. An efficient algorithm for solving the fixed-point problem is derived together with bounds that illustrate the quality of the approximation. A two-dimensional risk model is analyzed under a bailout type strategy with both fixed and variable costs and a dependence structure of the proposed type. Numerical examples and ideas for future research are presented at the end of the paper.     

Perfect controlled joint remote state preparation independent of entanglement degree of the quantum channel

We construct a quantum circuit to produce a task-oriented partially entangled state and use it as the quantum channel for controlled joint remote state preparation. Unlike most previous works, where the parameters of the quantum channel are given to the receiver who can accomplish the task only probabilistically by consuming auxiliary resource, operation and measurement, here we give them to the supervisor. Thanks to the knowledge of the task-oriented quantum channel parameters, the supervisor can carry out proper complete projective measurement, which, combined with the feed-forward technique adapted by the preparers, not only much economizes (simplifies) the receiver's resource (operation) but also yields unit total success probability. Notably, such apparent perfection does not depend on the entanglement degree of the shared quantum channel. Our protocol is within the reach of current quantum technologies.     

��β�ӳ��������ģ�����Ʋ����ʵĽ�����

In this paper, for a kind of risk models with heavy-tailed and delayed claims, we derive the asymptotics of the infinite-time ruin probability and the uniform asymptotics of the finite-time ruin probability. The numerical simulation results are also presented. The results of theoretical analysis and numerical simulation show that the influence of the delay for the claim payment is nearly negligible to the ruin probability when the initial capital and running-time are all large.     

Weber Correspondence Analysis: The One-Dimensional Case

When designing programs or software for the implementation of Monte Carlo (MC) hypothesis tests, we can save computation time by using sequential stopping boundaries. Such boundaries imply stopping resampling after relatively few replications if the early replications indicate a very large or a very small p value. We study a truncated sequential probability ratio test (SPRT) boundary and provide a tractable algorithm to implement it. We review two properties desired of any MC p value, the validity of the p value and a small resampling risk, where resampling risk is the probability that the accept/reject decision will be different than the decision from complete enumeration. We show how the algorithm can be used to calculate a valid p value and confidence intervals for any truncated SPRT boundary. We show that a class of SPRT boundaries is minimax with respect to resampling risk and recommend a truncated version of boundaries in that class by comparing their resampling risk (RR) to the RR of fixed boundaries with the same maximum resample size. We study the lack of validity of some simple estimators of p values and offer a new, simple valid p value for the recommended truncated SPRT boundary. We explore the use of these methods in a practical example and provide the MChtest R package to perform the methods.     

Rejoinder on “Statistical reasoning with set-valued information: Ontic vs. epistemic views”

This note replies to comments made on our contribution to the Low Quality Data debate.     

NIFTy 3 – Numerical Information Field Theory: A Python Framework for Multicomponent Signal Inference on HPC Clusters

NIFTy , “Numerical Information Field Theory,” is a software framework designed to ease the development and implementation of field inference algorithms. Field equations are formulated independently of the underlying spatial geometry allowing the user to focus on the algorithmic design. Under the hood, NIFTy ensures that the discretization of the implemented equations is consistent. This enables the user to prototype an algorithm rapidly in 1D and then apply it to high‐dimensional real‐world problems. This paper introduces NIFTy  3, a major upgrade to the original NIFTy  framework. NIFTy  3 allows the user to run inference algorithms on massively parallel high performance computing clusters without changing the implementation of the field equations. It supports n‐dimensional Cartesian spaces, spherical spaces, power spaces, and product spaces as well as transforms to their harmonic counterparts. Furthermore, NIFTy  3 is able to handle non‐scalar fields, such as vector or tensor fields. The functionality and performance of the software package is demonstrated with example code, which implements a mock inference inspired by a real‐world algorithm from the realm of information field theory. NIFTy  3 is open‐source software available under the GNU General Public License v3 (GPL‐3) at https://gitlab.mpcdf.mpg.de/ift/NIFTy/tree/NIFTy_3 .