Vector autoregression model is ubiquitous in classical time series data analysis. With the rapid advance of social network sites, over latent graph becoming increasingly popular. In this paper, we develop a novel Bayesian grouped to simultaneously estimate group information (number groups and configurations) group-wise parameters. Specifically, graphically assisted Chinese restaurant process in...

Fruit flies are a well-known invasive species, and climate-based risk modeling is used to inform analysis of these pests. However, such research tends focus on already species. This paper illustrates that appropriate can also provide valuable insights for which not yet “on the radar.” Carpomya pardalina locally important cucurbit-infesting fruit fly western central Asia, but it may present othe...

We consider shortest path problems defined on graphs with random arc costs. We assume that information on arc cost values is accumulated as the graph is being traversed. The objective is to devise a policy that leads from an origin to a destination node with minimal expected cost. We provide dynamic programming algorithms, estimates for their complexity, negative complexity results, and analysi...

We consider the logistics capacity planning problem arising in the context of supply-chain management. We address the tactical-planning problem of determining the quantity of capacity units, hereafter called bins, of different types to secure for the next period of activity, given the uncertainty on future needs in terms of demand for loads (items) to be moved or stored, and the availability an...

in this study a heat exchanger is designed for cooling exhaust gas and an experiment is carried out to investigate the effect of exhaust gas recirculation (egr) temperature on destruction of the fuel’s availability due to combustion processes in idi diesel engine cylinder. to serve this aim an exergy analysis is conducted on the engine cylinder which provides all the availability terms by which...

We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the constraint matrix and the right-hand side. The problem has the following form: given a set of operations to be executed along a time horizon, find a schedule to minimize a function included by the expected operations cos...