Apollo experience report: Command and service module electrical power distribution on subsystem

A review of the design philosophy and development of the Apollo command and service modules electrical power distribution subsystem, a brief history of the evolution of the total system, and some of the more significant components within the system are discussed. The electrical power distribution primarily consisted of individual control units, interconnecting units, and associated protective devices. Because each unit within the system operated more or less independently of other units, the discussion of the subsystem proceeds generally in descending order of complexity; the discussion begins with the total system, progresses to the individual units of the system, and concludes with the components within the units

Requiring an amyloid-β1-42 biomarker may improve the efficiency of a study, and simulations may help in planning studies

A recent article by Schneider and colleagues has generated a lot of interest in simulation studies as a way to improve study design. The study also illustrates the foremost principal in simulation studies, which is that the results of a simulation are an embodiment of the assumptions that went into it. This simulation study assumes that the effect size is proportional to the mean to standard deviation ratio of the Alzheimer Disease Assessment Scale - cognitive subscale in the population being studied. Under this assumption, selecting a subgroup for a clinical trial based on biomarkers will not affect the efficiency of the study, despite achieving the desired increase in the mean to standard deviation ratio

On a branch-and-bound approach for a Huff-like Stackelberg location problem

Modelling the location decision of two competing firms that intend to build a new facility in a planar market can be done by a Huff-like Stackelberg location problem. In a Huff-like model, the market share captured by a firm is given by a gravity model determined by distance calculations to facilities. In a Stackelberg model, the leader is the firm that locates first and takes into account the actions of the competing chain (follower) locating a new facility after the leader. The follower problem is known to be a hard global optimisation problem. The leader problem is even harder, since the leader has to decide on location given the optimal action of the follower. So far, in literature only heuristic approaches have been tested to solve the leader problem. Our research question is to solve the leader problem rigorously in the sense of having a guarantee on the reached accuracy. To answer this question, we develop a branch-and-bound approach. Essentially, the bounding is based on the zero sum concept: what is gain for one chain is loss for the other. We also discuss several ways of creating bounds for the underlying (follower) sub-problems, and show their performance for numerical cases