Genesis in Hyperreality: Legitimizing Disingenuous Controversy at the Creation Museum

This essay analyzes the argumentative structure of the Answers in Genesis ministry\u27s Creation Museum in Petersburg, Kentucky. Founded by a $27 million grant, the 70,000 square-foot museum appropriates the stylistic and authoritative signifiers of natural history museums, complete with technically proficient hyperreal displays and modern curatorial techniques. In this essay, we argue that the museum provides a culturally authoritative space in which Young Earth Creationists can visually craft the appearance that there is an ongoing scientific controversy over matters long settled in the scientific community (evolution), or what scholars call a disingenuous or manufactured controversy. We analyze the displays and layout as argumentative texts to explain how the museum negotiates its own purported status as a museum with its ideological mission to promulgate biblical literalism. The Creation Museum provides an exemplary case study in how the rhetoric of controversy is used to undermine existing scientific knowledge and legitimize pseudoscientific beliefs. This essay contributes to argumentation studies by explaining how religious fundamentalists simulate the structure of a contentious argument by adopting the material signifiers of expert authority to ground their claims

One Thing After Another: Why the Passage of Time Is Not an Illusion

Does time seem to pass, even though it doesn’t, really? Many philosophers think the answer is ‘Yes’—at least when ‘time’s passing’ is understood in a particular way. They take time’s passing to be a process by which each time in turn acquires a special status, such as the status of being the only time that exists, or being the only time that is present. This chapter suggests that, on the contrary, all we perceive is temporal succession, one thing after another, a notion to which modern physics is not inhospitable. The contents of perception are best described in terms of ‘before’ and ‘after’, rather than ‘past’, ‘present, and ‘future’

Foothill: A Quasiconvex Regularization for Edge Computing of Deep Neural Networks

Deep neural networks (DNNs) have demonstrated success for many supervised learning tasks, ranging from voice recognition, object detection, to image classification. However, their increasing complexity might yield poor generalization error that make them hard to be deployed on edge devices. Quantization is an effective approach to compress DNNs in order to meet these constraints. Using a quasiconvex base function in order to construct a binary quantizer helps training binary neural networks (BNNs) and adding noise to the input data or using a concrete regularization function helps to improve generalization error. Here we introduce foothill function, an infinitely differentiable quasiconvex function. This regularizer is flexible enough to deform towards $L_1$ and $L_2$ penalties. Foothill can be used as a binary quantizer, as a regularizer, or as a loss. In particular, we show this regularizer reduces the accuracy gap between BNNs and their full-precision counterpart for image classification on ImageNet.Comment: Accepted in 16th International Conference of Image Analysis and Recognition (ICIAR 2019

Generative discriminative models for multivariate inference and statistical mapping in medical imaging

This paper presents a general framework for obtaining interpretable multivariate discriminative models that allow efficient statistical inference for neuroimage analysis. The framework, termed generative discriminative machine (GDM), augments discriminative models with a generative regularization term. We demonstrate that the proposed formulation can be optimized in closed form and in dual space, allowing efficient computation for high dimensional neuroimaging datasets. Furthermore, we provide an analytic estimation of the null distribution of the model parameters, which enables efficient statistical inference and p-value computation without the need for permutation testing. We compared the proposed method with both purely generative and discriminative learning methods in two large structural magnetic resonance imaging (sMRI) datasets of Alzheimer's disease (AD) (n=415) and Schizophrenia (n=853). Using the AD dataset, we demonstrated the ability of GDM to robustly handle confounding variations. Using Schizophrenia dataset, we demonstrated the ability of GDM to handle multi-site studies. Taken together, the results underline the potential of the proposed approach for neuroimaging analyses.Comment: To appear in MICCAI 2018 proceeding

Evolving Spatially Aggregated Features from Satellite Imagery for Regional Modeling

Satellite imagery and remote sensing provide explanatory variables at relatively high resolutions for modeling geospatial phenomena, yet regional summaries are often desirable for analysis and actionable insight. In this paper, we propose a novel method of inducing spatial aggregations as a component of the machine learning process, yielding regional model features whose construction is driven by model prediction performance rather than prior assumptions. Our results demonstrate that Genetic Programming is particularly well suited to this type of feature construction because it can automatically synthesize appropriate aggregations, as well as better incorporate them into predictive models compared to other regression methods we tested. In our experiments we consider a specific problem instance and real-world dataset relevant to predicting snow properties in high-mountain Asia

Differential expression analysis with global network adjustment

<p>Background: Large-scale chromosomal deletions or other non-specific perturbations of the transcriptome can alter the expression of hundreds or thousands of genes, and it is of biological interest to understand which genes are most profoundly affected. We present a method for predicting a gene’s expression as a function of other genes thereby accounting for the effect of transcriptional regulation that confounds the identification of genes differentially expressed relative to a regulatory network. The challenge in constructing such models is that the number of possible regulator transcripts within a global network is on the order of thousands, and the number of biological samples is typically on the order of 10. Nevertheless, there are large gene expression databases that can be used to construct networks that could be helpful in modeling transcriptional regulation in smaller experiments.</p> <p>Results: We demonstrate a type of penalized regression model that can be estimated from large gene expression databases, and then applied to smaller experiments. The ridge parameter is selected by minimizing the cross-validation error of the predictions in the independent out-sample. This tends to increase the model stability and leads to a much greater degree of parameter shrinkage, but the resulting biased estimation is mitigated by a second round of regression. Nevertheless, the proposed computationally efficient “over-shrinkage” method outperforms previously used LASSO-based techniques. In two independent datasets, we find that the median proportion of explained variability in expression is approximately 25%, and this results in a substantial increase in the signal-to-noise ratio allowing more powerful inferences on differential gene expression leading to biologically intuitive findings. We also show that a large proportion of gene dependencies are conditional on the biological state, which would be impossible with standard differential expression methods.</p> <p>Conclusions: By adjusting for the effects of the global network on individual genes, both the sensitivity and reliability of differential expression measures are greatly improved.</p&gt

Selection of tuning parameters in bridge regression models via Bayesian information criterion

We consider the bridge linear regression modeling, which can produce a sparse or non-sparse model. A crucial point in the model building process is the selection of adjusted parameters including a regularization parameter and a tuning parameter in bridge regression models. The choice of the adjusted parameters can be viewed as a model selection and evaluation problem. We propose a model selection criterion for evaluating bridge regression models in terms of Bayesian approach. This selection criterion enables us to select the adjusted parameters objectively. We investigate the effectiveness of our proposed modeling strategy through some numerical examples.Comment: 20 pages, 5 figure

Quality management in heavy duty manufacturing industry: TQM vs. Six Sigma

‘Is TQM a management fad?’ This question has been extensively documented in the quality management literature; and will be tackled in this research though a critical literature review on the area. ‘TQM versus Six-Sigma’ debate, which has also been a fundamental challenge in this research filed, is addressed by a thematic and chronological review on the peer papers. To evaluate this challenge in practice, a primary research in heavy duty machinery production industry have been conducted using a case-study on, J C Bamford Excavators Ltd (JCB), the largest European construction machinery producer. The result highlights that TQM is a natural foundation to build up Six-Sigma upon; and not surprisingly the quality yield in a TQM approach complemented by Six-sigma is far higher and more stable than when TQM with no Six-Sigma focus is being put in place; thus presenting the overall finding that TQM and Six Sigma are compliments, not substitutes. The study will be concluded with an overview on quality management approaches in the heavy duty manufacturing industry to highlight the way forward for the industry

A Regularized Graph Layout Framework for Dynamic Network Visualization

Many real-world networks, including social and information networks, are dynamic structures that evolve over time. Such dynamic networks are typically visualized using a sequence of static graph layouts. In addition to providing a visual representation of the network structure at each time step, the sequence should preserve the mental map between layouts of consecutive time steps to allow a human to interpret the temporal evolution of the network. In this paper, we propose a framework for dynamic network visualization in the on-line setting where only present and past graph snapshots are available to create the present layout. The proposed framework creates regularized graph layouts by augmenting the cost function of a static graph layout algorithm with a grouping penalty, which discourages nodes from deviating too far from other nodes belonging to the same group, and a temporal penalty, which discourages large node movements between consecutive time steps. The penalties increase the stability of the layout sequence, thus preserving the mental map. We introduce two dynamic layout algorithms within the proposed framework, namely dynamic multidimensional scaling (DMDS) and dynamic graph Laplacian layout (DGLL). We apply these algorithms on several data sets to illustrate the importance of both grouping and temporal regularization for producing interpretable visualizations of dynamic networks.Comment: To appear in Data Mining and Knowledge Discovery, supporting material (animations and MATLAB toolbox) available at http://tbayes.eecs.umich.edu/xukevin/visualization_dmkd_201