Search

In this paper we explore the Vs-optimality criterion that was proposed in Ginsburg and Ben-Gal (IIE Trans. 2006; 38:445–461) as a new design-of-experiment (DOE) alphabetic optimality criterion. The Vs-optimality criterion seeks to minimize the variance of the optimal solution of an empirically fitted model. We show that the Vs-optimality citerion is well related to known alphabetic DOE criteria. However, it focuses on an 'optimization-seeking' experimental approach rather than an 'information-seeking' approach, which is often adopted by traditional optimality criteria. We illustrate the differences between these two approaches by a detailed example of a robust design of an RL-circuit. Copyright © 2009 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

The classical funnel experiment was used by Deming to promote the idea of statistical process control (SPC). The popular example illustrates that the implementation of simple feedback rules to stationary processes violates the independence assumption and prevents the implementation of conventional SPC. However, Deming did not indicate how to implement SPC in the presence of such feedback rules. This pedagogical gap is addressed here by introducing a simple feedback rule to the funnel example that results in a nonlinear process to which the traditional SPC methods cannot be applied. The proposed method of Markov-based SPC, which is a simplified version of the context-based SPC method, is shown to monitor the modified process well. Copyright © 2007 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

This work proposes a method to improve the QoS provided to internet users by website servers. In particular, the goal is to minimize the expected number of browsing steps (clicks), also known as the expected path length, which are required to reach a website page by a community of users. We use Markov chain modeling to represent the transition probabilities from one webpage to another, and the first passage from page to page that can be retrieved from web server logs. The proposed method deletes links among webpages to minimize the expected path length of the website. Three different methods for achieving this goal are examined: (i) a greedy deletion heuristic; (ii) an approximated branch and bound algorithm; and (iii) a cross-entropy metaheuristic. Numerical studies show that the proposed greedy heuristic results in the optimal solution in more than 60% of the tested cases, while in almost 90% of the cases, the obtained solution is within 10% of the optimal solution. Both the approximated branch and bound and the cross-entropy methods achieved optimality in more than 80% of the tested cases; however, this came with a much higher computational cost. Copyright © 2016 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]