酸碱平衡紊乱中肾调节作用的量化处理

将血浆中PaCO2作为自变量、△[HCO3-]/△PaCO2作为因变量,对慢性呼吸性酸碱平衡紊乱时,肾的代偿调节作用进行了量化处理.根据两者间的量化关系,看到:慢性呼吸性酸中毒时,随着血浆中PaCO2值越来越大,△[HCO3-]/△PaCO2的变化率越来越小;慢性呼吸性碱中毒时,随着血浆中PaCO2值越来越小,△[HCO3-]/△PaCO2的变化率也越来越小.这些结果完全符合生物学规律.提示这一量化处理对研究慢性呼吸性酸碱平衡紊乱时,肾代偿调节机制、代偿强度等有一定的意义.     

肺在酸碱平衡紊乱调节中的数学模型建立

将血浆中[HCO3-]作为自变量、△PaCO2/△[HCO3-]作为因变量,对酸碱平衡紊乱中肺的缓冲作用进行了量化处理并初步建立了数学模型.利用两者间的函数关系,看到:代谢性酸中毒时,随着血浆中[HCO3-]值越来越小,△PaCO2/△[HCO3-]的变化率也越来越小;代谢性碱中毒时,随着血浆中[HCO3-]值越来越大,△PaCO2/△[HCO3-]的变化率越来越小.这一结果完全符合生物学规律.提示这一数学模型对研究酸碱平衡紊乱时,肺代偿调节机制、代偿强度等情况有一定的意义.     

Polygon vertex extremality and decomposition of polygons

In this paper, we show that if we decompose a polygon into two smaller polygons, then by comparing the number of extremal vertices in the original polygon versus the sum of the two smaller polygons, we can gain at most two globally extremal vertices in the smaller polygons, as well as at most two locally extremal vertices. We then will derive two discrete Four-Vertex Theorems from our results.     

A maximum principle for harmonic mappings which solve a Dirichlet problem

We show that if a solution of the Dirichlet problem for harmonic maps lies in a convex ball and its boundary values are contained in some smaller ball, then the whole solution itself is contained in this smaller ball.     

Formula for primes,twinprimes, number of primes and number of twinprimes

Formulae for computing thenth prime, twinprime, the number of primes smaller than a given integer, and the number of twinprimes smaller than a given integer are presented. Proofs for the development are also furnished.     

Wavelet Shrinkage Denoising Using the Non-Negative Garrote

Abstract

In this article, we combine Donoho and Johnstone's wavelet shrinkage denoising technique (known as WaveShrink) with Breiman's non-negative garrote. We show that the non-negative garrote shrinkage estimate enjoys the same asymptotic convergence rate as the hard and the soft shrinkage estimates. Simulations are used to demonstrate that garrote shrinkage offers advantages over both hard shrinkage (generally smaller mean-square-error and less sensitivity to small perturbations in the data) and soft shrinkage (generally smaller bias and overall mean-square-error). The minimax thresholds for the non-negative garrote are derived and the threshold selection procedure based on Stein's unbiased risk estimate (SURE) is studied. We also propose a threshold selection procedure based on combining Coifman and Donoho's cycle-spinning and SURE. The procedure is called SPINSURE. We use examples to show that SPINSURE is more stable than SURE: smaller standard deviation and smaller range.     

New product introduction and capacity investment by incumbents: Effects of size on strategy

We analyze a duopoly where capacity-constrained firms offer an established product and have the option to offer an additional new and differentiated product. We show that the firm with the smaller capacity on the established market has a higher incentive to innovate and reaches a larger market share on the market for the new product. An increase in capacity of the larger firm can prevent its competitor from innovating, whereas an increase in capacity of the smaller firm cannot prevent innovation of its larger competitor. In equilibrium the firm with smaller capacity on the established market might outperform the larger firm with respect to total payoffs.     

Work effort, consumption, and portfolio selection: when the occupational choice matters

We consider a highly-qualified individual with respect to her choice between two distinct career paths. She can choose between a mid-level management position in a large company and an executive position within a smaller listed company with the possibility to directly affect the company’s share price. She invests in the financial market including the share of the smaller listed company. The utility maximizing strategy from consumption, investment, and work effort is derived in closed form for logarithmic utility. The power utility case is discussed as well. Conditions for the individual to pursue her career with the smaller listed company are obtained. The participation constraint is formulated in terms of the salary differential between the two positions. The smaller listed company can offer less salary. The salary shortfall is offset by the possibility to benefit from her work effort by acquiring own-company shares. This gives insight into aspects of optimal contract design. Our framework is applicable to the pharmaceutical and financial industry, and the IT sector.     

单台机以总完工时间为目标的批排序问题

研究单台机,工件加工时间相等,大小不同的批排序问题,给出了一个最坏情况界为9+3~(1/2)/6≈1.7817的多项式时间近似算法,并证明了即使工件总大小不超过2,该问题也不存在FPTAS,除非P=NP.     

Ratios

<正>When am I ever going to use this?GEARS Gears are used in objects thathave spinning parts,such as bicycles and pendulum clocks.Suppose you have a larger gear that has 80 teeth beingturned by a smaller gear that has 20 teeth.The comparison of the size of the larger gear to the size of the smaller gear is called a gear ratio.     

The complex Busemann-Petty problem on sections of convex bodies

The complex Busemann-Petty problem asks whether origin symmetric convex bodies in Cn with smaller central hyperplane sections necessarily have smaller volume. We prove that the answer is affirmative if n?3 and negative if n?4.     

Numeration of non-decreasing and non-increasing serial sequences

Finite sets of n-valued serial sequences are examined. Their structure is determined not only by restrictions on the number of series and series lengths, but also by restrictions on the series heights, which define the order number of series and their lengths, but also is limited to the series heights, by whose limitations the order of series of different heights is given. Solutions to numeration and generation problems are obtained for the following sets of sequences: non-decreasing and non-increasing sequences where the difference in heights of the neighboring series is either not smaller than a certain value or not greater than a certain value. Algorithms that assign smaller numbers to lexicographically lower sequences and smaller numbers to lexicographically higher sequences are developed.     

On Intersection Lattices of Hyperplane Arrangements Generated by Generic Points

We consider hyperplane arrangements generated by generic points and study their intersection lattices. These arrangements are known to be equivalent to discriminantal arrangements. We show a fundamental structure of the intersection lattices by decomposing the poset ideals as direct products of smaller lattices corresponding to smaller dimensions. Based on this decomposition we compute the M?bius functions of the lattices and the characteristic polynomials of the arrangements up to dimension six.     

关于图的强乘积的可迁性的研究（英文）

Since many large graphs are composed from some existing smaller graphs by using graph operations, say, the Cartesian product, the Lexicographic product and the Strong product. Many properties of such large graphs are closely related to those of the corresponding smaller ones. In this short note, we give some properties of the Strong product of vertex-transitive graphs. In particular, we show that the Strong product of Cayley graphs is still a Cayley graph.     

An entropic gradient structure for quasi-steady-state approximations of chemical reactions

Passing to the limit of an infinite reaction rate in a slow-fast system of chemical reactions provides a quasi-steady state approximation (QSSA) of these systems. In case of reactions with detailed balance condition, this approximation includes a dimension reduction to a smaller state space. We show that the limit dynamics carry an entropic gradient structure on this smaller space. (© 2016 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Aggregation of constraints in integer programming

Constraint aggregation provides a method of formulating equivalent integer programs with a smaller number of constraints. This approach was widely researched in the seventies but its use was discounted due to large coefficients in the equivalent problem. We provide a method that yields numerically smaller constraint coefficients. This method has enabled us to investigate other computational issues relating to the use of constraint aggregation in solving integer programming problems, more thoroughly than has previously been possible.     

关于停止损失再保险的调节系数最大化问题

停止损失再保险作为一种再保险方式,在具有相同保费的前提下,能使保险人的期望效用最大,并能使其自留风险方差最小.另外在保费和费率相等的前提下,停止损失再保险的调节系数不可能比其他再保险方式的调节系数小.本论文在此基础上作了相应推广,讨论了在保费相等的前提下,停止损失再保险的费率满足时,其调节系数不小于其他再保险方式的调节系数.     

Stochastic ordering of medians in exchangeable trivariate normal vectors

In this paper, we establish the stochastic ordering of median from an exchangeable trivariate normal vector based on the strength of the correlation coefficient. Specifically, by considering two exchangeable trivariate normal vectors with different correlation coefficients, we show that the absolute value of the median in the vector with smaller correlation coefficient is stochastically smaller than the absolute value of the median in the vector with larger correlation coefficient. We prove this result by utilizing skew-normal distributions.     

Schur‐convexity and quadrature formulae

This paper aims to contribute to the exploration of quadrature formulae by proving that the error of a quadrature formula has the Schur‐convexity property. The emphasis is on the quadrature formulae with the maximum degree of precision. The Schur‐convexity of the error has an interesting implication – the monotonicity of the error. Namely, it turns out that the absolute value of the error is always smaller on a smaller interval (of the two which share the same midpoint).     

RECURSIVE REPRODUCING KERNELS HILBERT SPACES USING THE THEORY OF POWER KERNELS

The main objective of this work is to decompose orthogonally the reproducing kernels Hilbert space using any conditionally positive definite kernels into smaller ones by introducing the theory of power kernels, and to show how to do this decomposition recursively. It may be used to split large interpolation problems into smaller ones with different kernels which are related to the original kernels. To reach this objective, we will reconstruct the reproducing kernels Hilbert space for the normalized and the extended kernels and give the recursive algorithm of this decomposition.