Identifying optimal designs for generalized linear models with a binary response can be a challengingtask, especially when there are both discrete and continuous independent factors in the model. Theoreticalresults rarely exist for such models, and for the handful that do, they usually come with restrictive assumptions.In this article, we propose the d-QPSO algorithm, a modified version of quantum-behaved particleswarm optimization, to find a variety of D-optimal approximate and exact designs for experiments withdiscrete and continuous factors and a binary response. We show that the d-QPSO algorithm can efficientlyfind locally D-optimal designs even for experiments with a large number of factors and robust pseudo-Bayesian designs when nominal values for the model parameters are not available. Additionally, we investigaterobustness properties of the d-QPSO algorithm-generated designs to variousmodel assumptions andprovide real applications to design a bio-plastics odor removal experiment, an electronic static experiment,and a 10-factor car refueling experiment. Supplementary materials for the article are available online.

There is well-documented evidence of brain network differences between individuals with Alzheimer's disease (AD) and healthy controls (HC). To date, imaging studies investigating brain networks in these populations have typically been cross-sectional, and the reproducibility of such findings is somewhat unclear. In a novel study, we use the longitudinal ADNI data on the whole brain to jointly compute the brain network at baseline and one-year using a state of the art approach that pools information across both time points to yield distinct visit-specific networks for the AD and HC cohorts, resulting in more accurate inferences. We perform a multiscale comparison of the AD and HC networks in terms of global network metrics as well as at the more granular level of resting state networks defined under a whole brain parcellation. Our analysis illustrates a decrease in small-worldedness in the AD group at both the time points and also identifies more local network features and hub nodes that are disrupted due to the progression of AD. We also obtain high reproducibility of the HC network across visits. On the other hand, a separate estimation of the networks at each visit using standard graphical approaches reveals fewer meaningful differences and lower reproducibility.