1 Zhejiang Provincial Key Laboratory of Applied Enzymology, Yangtze Delta Region Institute of Tsinghua University, Jiaxing 314006, P. R. China. 2 College of Biological and Environmental Sciences, Zhejiang Wanli University, Ningbo 315100, P. R. China. 3 Molecular Inflammation Research Center for Aging Intervention (MRCA), College of Pharmacy, Pusan National University, Busan 609-735, Korea. 4 De...

The Logarithmic Bit-Significance Ratio (S-value) is a universal measure to quantify the significances of the bits in a communication system. We define the S-value and discuss relations to the well-known L-values that are used for soft-in/soft-out decoding at the receiving end. We argue that the S-values are the transmitter-based counterpart of the L-values, and we motivate the idea of soft-in/s...

In this paper we present a computationally efficient method of evaluating the probability of multiple correct packet reception in coded synchronous frequency-hopped spreadspectrum (FHSS) networks. We show that the approximation using the independent receiver operation assumption (IROA), which has been frequently employed in the literature without rigorous validation, produces reasonable results...

Over the last 20 years, the increasing complexity and technical intensiveness of health care in French hospitals have increased the level of uncertainty in the process of care. This paper argues that beyond quality management approaches, the most important issue in health care management is the need to implement new organizational methods in response to the dynamic changes that are transforming...

Molecular clocks give “Time to most recent common ancestor” TMRCA of genetic trees. By Watson-Galton most lineages terminate, with a few overrepresented singular lineages generated by W. Hamilton’s “kin selection”. Applying current methods to this non-uniform branching produces greatly exaggerated TMRCA. We introduce an inhomogenous stochastic process which detects singular lineages by asymmetr...

most network charges are based on components’ thermal limits providing correct economic signals to reinforcing network transformers and lines. However, less attention is drawn to the reinforcement cost driven by nodal voltage limits, particularly those resulting from contingencies. In this work, a new charging approach is proposed in which busbar power perturbation is linked to busbar voltage d...

Coalescence processes have received a lot of attention in the context of conditional branching processes with fixed population size and nonoverlapping generations. Here we focus on similar problems in the context of the standard unconditional Bienaymé-Galton-Watson branching processes, either (sub)-critical or supercritical. Using an analytical tool, we derive the structure of some counting asp...

In a population of constant size, whose family sizes evolve as Wright-Fisher diffusions, all individuals alive at time t have a most recent common ancestor (MRCA) who lived at time A(t), say. The process (A(t)) has piecewise constant paths. At each jump time En, a new MRCA takes over, who lived at time Bn := A(En). We construct the random sequence (Bn, En) in terms of a look-down process and in...

Arithmetic coding is a well-known technique for lossless coding or data compression. It is based on splitting a current interval into sub-intervals, each sub-interval corresponding to a possible symbol to be encoded and the size of each sub-interval corresponding to the probability of the associated symbol. This involves multiplying the current interval size A by one or more probabilities, whic...

We describe a numbering scheme for versions with alternatives that has a useful lexicographical ordering. The version hierarchy is a tree. By inspection of the version numbers, we can easily determine whether one version is an ancestor of another. If so, we can determine the version sequence between these two versions. If not, we can determine the most recent common ancestor to these two versio...