Circuit optimization via sequential computer experiments: design of an output buffer

In electrical engineering, circuit designs are now often optimized via circuit simulation computer models. Typically, many response variables characterize the circuit's performance. Each response is a function of many input variables, including factors that can be set in the engineering design and noise factors representing manufacturing conditions. We describe a modelling approach which is appropriate for the simulator's deterministic input–output relationships. Non-linearities and interactions are identified without explicit assumptions about the functional form. These models lead to predictors to guide the reduction of the ranges of the designable factors in a sequence of experiments. Ultimately, the predictors are used to optimize the engineering design. We also show how a visualization of the fitted relationships facilitates an understanding of the engineering trade-offs between responses. The example used to demonstrate these methods, the design of a buffer circuit, has multiple targets for the responses, representing different trade-offs between the key performance measures.     

An empirical Bayes' procedure for ranking players in Ryder Cup golf

We describe a model to obtain strengths and rankings of players appearing in golf's Ryder Cup. Obtaining rankings is complicated because of two reasons. First, competitors do not compete on an equal number of occasions, with some competitors appearing too infrequently for their ranking to be estimated with any degree of certainty, and second, different competitors experience different levels of volatility in results. Our approach is to assume the competitor strengths are drawn from some common distribution. For small numbers of competitors, as is the case here, we fit the model using Monte-Carlo integration. Results suggest there is very little difference between the top performing players, though Scotland's Colin Montgomerie is estimated as the strongest Ryder Cup player.     

A delay-in-payment contract for Pareto improvement of a supply chain with stochastic demand

We consider a supply chain consisting of a single supplier and a single retailer with stochastic customer demand, which is operated over an infinite horizon. We propose a delay-in-payment contract to coordinate the supply chain. With this contract, the supplier allows the retailer to pay partial order cost at the ordering epoch, and to pay the remaining portion after a permissible number of periods. The system is formulated as a stochastic dynamic programming problem. It is shown that there exists a base-stock policy to be optimal. Compared with the traditional wholesale-price contract, the delay-in-payment contract with appropriate parameters can achieve a Pareto improvement (i.e., the performances of both the supplier and the retailer using the delay-in-payment contract are better than those using the wholesale-price contract). Numerical studies are performed to investigate both the effectiveness of the Pareto improvement, and the impact of the major parameters of the delay-in-payment contract on the system performance.     

On a system of nonhomogeneous components sharing a common frailty

The components of a reliability system subjected to a common random environment usually have dependent lifetimes. This paper studies the stochastic properties of such a system with lifetimes of the components following multivariate frailty models and multivariate mixed proportional reversed hazard rate (PRHR) models, respectively. Through doing stochastic comparison, we devote to throwing a new light on how the random environment affects the number of working components of a reliability system and on assessing the performance of a k-out-of-n system.     

Analytic strategies for longitudinal networks with missing data

Missing data are often problematic when analyzing complete longitudinal social network data. We review approaches for accommodating missing data when analyzing longitudinal network data with stochastic actor-based models. One common practice is to restrict analyses to participants observed at most or all time points, to achieve model convergence. We propose and evaluate an alternative, more inclusive approach to sub-setting and analyzing longitudinal network data, using data from a school friendship network observed at four waves (N = 694). Compared to standard practices, our approach retained more information from partially observed participants, generated a more representative analytic sample, and led to less biased model estimates for this case study. The implications and potential applications for longitudinal network analysis are discussed.     

Reliability analysis of systems with components having two dependent subcomponents

In this article, a system that consists of n independent components each having two dependent subcomponents (A_i, B_i), i = 1, …, n is considered. The system is assumed to compose of components that have two correlated subcomponents (A_i, B_i), and functions iff both systems of subcomponents A₁, A₂, …, A_n and B₁, B₂, …, B_n work under certain structural rules. The expressions for reliability and mean time to failure of such systems are obtained. A sufficient condition to compare two systems of bivariate components in terms of stochastic ordering is also presented.     

Why Frequency is Not Well Defined for Engineering Systems with Nonexponential Failure Times

Dr. Yellman proposes to define frequency as “a time‐rate of events of a specified type over a particular time interval.” We review why no definition of frequency, including this one, can satisfy both of two conditions: (1) the definition should agree with the ordinary meaning of frequency, such as that less frequent events are less likely to occur than more frequent events, over any particular time interval for which the frequencies of both are defined; and (2) the definition should be applicable not only to exponentially distributed times between (or until) events, but also to some nonexponential (e.g., uniformly distributed) times. We make the simple point that no definition can satisfy (1) and (2) by showing that any definition that determines which of any two uniformly distributed times has the higher “frequency” (or that determines that they have the same “frequency,” if neither is higher) must assign a higher frequency number to the distribution with the lower probability of occurrence over some time intervals. Dr. Yellman's proposed phrase, “time‐rate of events … over a particular time interval” is profoundly ambiguous in such cases, as the instantaneous failure rates vary over an infinitely wide range (e.g., from one to infinity), making it unclear which value is denoted by the phrase “time‐rate of events.”     

Some Results Based on a Version of the Generalized Dynamic Entropies

We propose new dynamic measures of uncertainty based on the notion of generalized dynamic entropy introduced in Di Crescenzo and Longobardi (2006). These can uniquely determine distribution functions in continuous and discrete cases, and the characterizations of some well-known distributions are provided. We also define some orderings and aging notions based on the generalized dynamic measures, and prove some of their properties, obtaining as corollaries results that have recently appeared in the literature.     

Construction of balanced incomplete block designs with partial cycles of blocks

When considering systems statisfying balanced incomplete block design structure, one is interested only in distinct configurations in the sense of isomorphism. We have determined additional non-isomorphic solutions to designs with previously established solutions through consideration of automorphism groups. This effort utilizes a classic technique of direct construction, namely, symmetrically repeated differences, modified slightly when constucting designs with partial cycles of blocks. To determine te base blocks, we utilize the computer to expedite some formidable enumeration     

Integrated framework for robustness analysis using ratio-based efficiency model with application to evaluation of Polish airports

We consider a problem of evaluating efficiency of Decision Making Units (DMUs) based on their deterministic performance on multiple consumed inputs and multiple produced outputs. We apply a ratio-based efficiency measure, and account for the Decision Maker׳s preference information representable with linear constraints involving input/output weights. We analyze the set of all feasible weights to answer various robustness concerns by deriving: (1) extreme efficiency scores and (2) extreme efficiency ranks for each DMU, (3) possible and necessary efficiency preference relations for pairs of DMUs, (4) efficiency distribution, (5) efficiency rank acceptability indices, and (6) pairwise efficiency outranking indices. The proposed hybrid approach combines and extends previous results from Ratio-based Efficiency Analysis and the SMAA-D method. The practical managerial implications are derived from the complementary character of accounted perspectives on DMUs׳ efficiencies. We present an innovative open-source software implementing an integrated framework for robustness analysis using a ratio-based efficiency model on the diviz platform. The proposed approach is applied to a real-world problem of evaluating efficiency of Polish airports. We consider four inputs related to the capacities of a terminal, runways, and an apron, and to the airport׳s catchment area, and two outputs concerning passenger traffic and number of aircraft movements. We present how the results can be affected by integrating the weight constraints and eliminating outlier DMUs.