Predicting the bed occupancy of an intensive care unit (ICU) is a daunting task. The uncertainty associated with the prognosis of critically ill patients and the random arrival of new patients can lead to capacity problems and the need for reactive measures. In this paper, we work towards a predictive model based on Random Survival Forests which can assist physicians in estimating the bed occup...

The loop-erased random walk (LERW) in three dimensions is obtained by erasing loops chronologically from simple random walk. In this paper we show the existence of the two-sided LERW which can be considered as the distribution of the LERW as seen by a point in the “middle” of the path.

The loop-erased random walk (LERW) in Zd, d ≥ 2, dimensions is obtained by erasing loops chronologically from simple random walk. In this paper we show the existence of the two-sided LERW which can be considered as the distribution of the LERW as seen by a point in the “middle” of the path.

We study a potentially useful methodology based on machine learning (ML) involving integration of separate biomarker classes, to improve prediction and separation of ovarian cancer survival times. We also imported intermediate survival information for separating extreme two groups. For prediction of survival phenotypes, we use four classifiers, first two existing machine learning methods (suppo...

forest types mapping, is one of the most necessary elements in the forest management and silviculture treatments. traditional methods such as field surveys are almost time-consuming and cost-intensive. improvements in remote sensing data sources and classification –estimation methods are preparing new opportunities for obtaining more accurate forest biophysical attributes maps. this research co...

We consider the height of random k-trees and k-Apollonian networks. These random graphs are not really trees, but instead have a tree-like structure. The height will be the maximum distance of a vertex from the root. We show that w.h.p. the height of random k-trees and k-Apollonian networks is asymptotic to c log t, where t is the number of vertices, and c = c(k) is given as the solution to a t...

Recently automatic image annotation (AIA) has been arising as a key technology to support image retrieval. The representative algorithm is Semantic Multiclass Labeling (SML [1]), which constructs a parametric generative model of a distribution of local image features in a class with a gaussian mixture model. Although SML shows good accuracy, SML has not been used widely because of its long trai...

Forest harvest scheduling has been modeled using deterministic and stochastic programming models. Past models seldom address explicit spatial forest management concerns under the influence of natural disturbances. In this research study, we employ multistage full recourse stochastic programming models to explore the challenges and advantages of building spatial optimization models that account ...

In a coastal, fog-influenced forest on Santa Cruz Island in southern California, we observed mortality of Bishop pine (Pinus muricata D.Don) trees following a brief (2 year), yet intense, drought. While anecdotal evidence indicates that drought-induced Bishop pine mortality has occurred in the past in the stand we studied, this is the first attempt to capture the spatial distribution of mortali...