James N. Bodurtha, Jr. and Qi Shen* July 1994 last revised: October 1999 Abstract “Value at risk” is a measure of corporations’ and banking institutions’ sensitivity to market price movements. This measure has been adopted as a global capital adequacy standard. Since value at risk management is a portfolio application, value at risk measurement requires standard deviation and correlation estima...

Hospitals increasingly use process models for structuring their care processes. Activities performed to patients are logged to a database or a log. These data can be used for managing and improving the efficiency of care processes and quality of care. In this article, we propose the method for estimation of deviation of care processes from a care plan. Care plan defines the steps of a patient t...

In this paper we refine the notion of tree-decomposition by introducing acyclic (R,D)-clustering, where clusters are subsets of vertices of a graph and R and D are the maximum radius and the maximum diameter of these subsets. We design a routing scheme for graphs admitting induced acyclic (R,D)-clustering where the induced radius and the induced diameter of each cluster are at most 2. We show t...

IMPORTANCE In strabismus, the fixating eye conveys the direction of gaze while the fellow eye points at a peripheral location in space. The stability of the eyes may be reduced by the absence of a common target. OBJECTIVE To quantify the stability of eye position in strabismus and to measure variability in the ocular deviation. DESIGN, SETTING, AND PARTICIPANTS From 2010 to 2014, a prospect...

Equations that can be used for partition coefficients of both neutral molecules and ions have been revised, and the term that is specific to ions has been re-evaluated. A new method has been devised for the determination of partition coefficients from water to organic solvents for carboxylate anions that is based on the variation of pK(a) for carboxylic acids with solvent. Using these partition...

We give a distributed randomized algorithm to edge colour a network. Let G be a graph with n nodes and maximum degree ∆. Here we prove: • If ∆ = Ω(log n) for some δ > 0 and λ > 0 is fixed, the algorithm almost always colours G with (1 + λ)∆ colours in time O(logn). • If s > 0 is fixed, there exists a positive constant k such that if ∆ = Ω(log n), the algorithm almost always colours G with ∆ +∆/...

Background There is currently no formal method for predicting the range expected in an individual's seizure counts. Having access to such a prediction would be of benefit for developing more efficient clinical trials, but also for improving clinical care in the outpatient setting. Methods Using three independently collected patient diary datasets, we explored the predictability of seizure fre...

A methodology is proposed for the prediction of the Gibbs energy of solvation (Δ(Solv)G) based on MD simulations. The methodology is then used to predict Δ(Solv)G of four solutes (namely propane, benzene, ethanol and acetone) in several solvents of different polarities (including n-hexane, n-hexadecane, ethylbenzene, 1-octanol, acetone and water) while testing the validity of the TraPPE force f...

as n → ∞. This is a deep extension of Hardy-Ramanujan Theorem (see [13]). In addition, the central limit theorem holds in a more general setting for additive functions. A formal treatment and proofs can be found in e.g. Durrett [7]. In terms of rate of convergence to the Gaussian distribution, i.e. Berry-Esseen bounds, Rényi and Turán [18] obtained the sharp rate of convergenceO(1/ √ log logn)....