On Producing Multiple Solutions Using Repeated Trials

The number of trials that is required by an algorithm to produce a given fraction of the problem solutions with a specified level of confidence is analyzed. The analysis indicates that the number of trials required to find a large fraction of the solutions rapidly decreases as the number of solutions obtained on each trial by an algorithm increases. In applications where multiple solutions are sought, this decrease in the number of trials could potentially offset the additional computational cost of algorithms that produce multiple solutions on a single trial. The analysis framework presented is used to compare the efficiency of a homotopy algorithm to that of a Newton method by measuring both the number of trials and the number of calculations required to obtain a specified fraction of the solutions.     

On the distribution of the number of retrials

We consider queuing systems where customers are not allowed to queue, instead of that they make repeated attempts, or retrials, in order to enter service after some time. We obtain the distribution of the number of retrials produced by a tagged customer, until he finds an available server.     

On bulk-service MAP/PH L,N /1/N G-Queues with repeated attempts

We consider a retrial queue with a finite buffer of size N, with arrivals of ordinary units and of negative units (which cancel one ordinary unit), both assumed to be Markovian arrival processes. The service requirements are of phase type. In addition, a PH^L,N bulk service discipline is assumed. This means that the units are served in groups of size at least L, where 1≤ L≤ N. If at the completion of a service fewer than L units are present at the buffer, the server switches off and waits until the buffer length reaches the threshold L. Then it switches on and initiates service for such a group of units. On the contrary, if at the completion of a service L or more units are present at the buffer, all units enter service as a group. Units arriving when the buffer is full are not lost, but they join a group of unsatisfied units called “orbit”. Our interest is in the continuous-time Markov chain describing the state of the queue at arbitrary times, which constitutes a level dependent quasi-birth-and-death process. We start by analyzing a simplified version of our queueing model, which is amenable to numerical calculation and is based on spatially homogeneous quasi-birth-and-death processes. This leads to modified matrix-geometric formulas that reveal the basic qualitative properties of our algorithmic approach for computing performance measures. AMS Subject Classification: Primary 60K25 Secondary 68M20 90B22.     

微量元素锌与反复呼吸道感染的相关性

对28例反复呼吸道感染患儿(下称复感儿)及26例健康儿进行微量元素发锌测定。发现前者发锌平均值为(92.3±14.7)×10~(-6),后者为(132.5±21.5)×10~(-6),P<0.01,差异非常显著。对复感儿进行口服锌治疗,观察其疗效及治疗前后发锌变化。治疗前发锌平均值为(92.3±14.7)×10~(-6),治疗后为(137.5±20.2)×10~(-6),P<0.01差异非常显著。有效率达85.7％。故缺锌可能是复感儿患病的影响因素之一,锌治疗小儿反复呼吸道感染是十分必要的。     

Correlation between repeated measurements: bane and boon of the GUM approach to the uncertainty of measurement

With measurement uncertainty estimation accounting for all relevant uncertainty contributions, the results of measurements using the same procedure on different objects or samples may no longer be considered as being independent, and correlations have to be taken into account. For this purpose, a simple approximation for the estimation of covariances is derived and applied to the estimation of uncertainty for some basic combinations of two measurement results. This covariance estimate is also applied to the estimation of uncertainty for the mean value of the results of replicate measurements on the same object or sample.

浅谈制药工程专业有机化学实验教学的心得和体会——以三苯甲醇的制备和重结晶实验为例

有机化学实验是制药工程专业的一门必修课,旨在训练学生有机合成基本实验技能。本文以三苯甲醇的制备和重结晶实验为例,讲述了笔者在多年教学中获得的一点感悟和经验:1)将实验步骤分解成片断讲解可以使学生更好地理解和记忆实验过程和操作目的;2)重要的基本操作应反复练习,即"学习、复习、提高",通过三次重复练习来实现巩固和熟练掌握该操作的目的。     

基于BP网络的混凝土耗能器骨架曲线拟合

结合5种混凝土延性柱耗能器在低周期反复荷载作用下的试验数据研究,利用神经网络的工作原理,通过建立神经网络的输入层、隐含层、输出层,确定输入单元、输出单元和隐含层节点数,从而建立了BP神经网络的模型,并根据已有的部分试验数据数据.对网络进行训练,对各种混凝土延性柱耗能器骨架曲线进行了预测拟合,实现混凝土延性柱耗能器骨架曲线的数字化,使其成为具有分析和判断的拟合曲线功能,完整的描绘混凝土延性柱耗能器的骨架曲线,为后续混凝土延性柱耗能器性能研究的仿真模拟提供了可靠的数据模型.结果表明,这种方法是可行的.     

单模光纤中高阶非线性极化率的计算

从非简谐振子模型出发，通过求解迭代方程，计算出三阶非线性极化率及四阶非线性极化率，并给出了高阶非线性极化率的普适公式     

Repeated Downsian electoral competition

We analyze an infinitely repeated version of the Downsian model of elections. The folk theorem suggests that a wide range of policy paths can be supported by subgame perfect equilibria when parties and voters are sufficiently patient. We go beyond this result by imposing several suitable refinements and by giving separate weak conditions on the patience of voters and the patience of parties under which every policy path can be supported. On the other hand, we show that only majority undominated policy paths can be supported in equilibrium for arbitrarily low voter discount factors: if the core is empty, the generic case in multiple dimensions, then voter impatience leads us back to the problem of non-existence of equilibrium. We extend this result to give conditions under which core equivalence holds for a non-trivial range of voter and party discount factors, providing a game-theoretic version of the Median Voter Theorem in a model of repeated Downsian elections. J. Duggan was supported by the National Science Foundation, grant number 0213738, is gratefully acknowledged.     

断陷盆地层滑带的发育特征及矿山开发条件下的再变形分析

层滑带在华北断陷盆地中具有普遍性,是影响地下矿山工程围岩稳定的重要因素之一。本文以鲁西矿区为例,阐述了断陷盆地层滑带的发育特征及其形成机制,进行了开挖、运营条件下层滑带再变形分析,并指出了层滑带发育区巷道设计及维护中应注意的某些问题。