More Like this

1. Thinking Inversely in Engineering Design: Towards an Operational Definition of Generative Design Thinking

   Clay, J Z; Li, X; Demirel, O; Goldstein, M H; Jiang, R; Xie, C; Zabelina, D L; Sha, Z (June 2024, American Society for Engineering Education)
2. The Limits of an Information Intermediary in Auction Design

   https://doi.org/10.1145/3490486.3538370  

   Alijani, Reza; Banerjee, Siddhartha; Munagala, Kamesh; Wang, Kangning (July 2022, EC '22: Proceedings of the 23rd ACM Conference on Economics and Computation)
3. An Approximation Algorithm for Blocking of an Experimental Design

   https://doi.org/10.1111/rssb.12545  

   Karmakar, Bikram (October 2022, Journal of the Royal Statistical Society Series B: Statistical Methodology)

   Abstract Blocked randomized designs are used to improve the precision of treatment effect estimates compared to a completely randomized design. A block is a set of units that are relatively homogeneous and consequently would tend to produce relatively similar outcomes if the treatment had no effect. The problem of finding the optimal blocking of the units into equal sized blocks of any given size larger than two is known to be a difficult problem—there is no polynomial time method guaranteed to find the optimal blocking. All available methods to solve the problem are heuristic methods. We propose methods that run in polynomial time and guarantee a blocking that is provably close to the optimal blocking. In all our simulation studies, the proposed methods perform better, create better homogeneous blocks, compared with the existing methods. Our blocking method aims to minimize the maximum of all pairwise differences of units in the same block. We show that bounding this maximum difference ensures that the error in the average treatment effect estimate is similarly bounded for all treatment assignments. In contrast, if the blocking bounds the average or sum of these differences, the error in the average treatment effect estimate can still be large in several treatment assignments. 

   more » « less
4. An additive framework for kirigami design

   https://doi.org/10.1038/s43588-023-00448-9  

   Dudte, Levi H.; Choi, Gary P.; Becker, Kaitlyn P.; Mahadevan, L. (May 2023, Nature Computational Science)
5. An additive algorithm for origami design

   https://doi.org/10.1073/pnas.2019241118  

   Dudte, Levi H.; Choi, Gary P. T.; Mahadevan, L. (May 2021, Proceedings of the National Academy of Sciences)

   Inspired by the allure of additive fabrication, we pose the problem of origami design from a different perspective: How can we grow a folded surface in three dimensions from a seed so that it is guaranteed to be isometric to the plane? We solve this problem in two steps: by first identifying the geometric conditions for the compatible completion of two separate folds into a single developable fourfold vertex, and then showing how this foundation allows us to grow a geometrically compatible front at the boundary of a given folded seed. This yields a complete marching, or additive, algorithm for the inverse design of the complete space of developable quad origami patterns that can be folded from flat sheets. We illustrate the flexibility of our approach by growing ordered, disordered, straight, and curved-folded origami and fitting surfaces of given curvature with folded approximants. Overall, our simple shift in perspective from a global search to a local rule has the potential to transform origami-based metastructure design. 

   more » « less