Optimal succinct representation of planar maps

This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the focus is here on designing data structures that preserve the possibility of answering incidence queries in constant time. We propose in particular the first optimal representations for 3-connected planar graphs and triangulations, which are the most standard classes of graphs underlying meshes with spherical topology. Optimal means that these representations asymptotically match the respective entropy of the two classes, namely 2 bits per edge for 3-c planar graphs, and 1.62 bits per triangle or equivalently 3.24 bits per vertex for triangulations

ME Design and Freeform Fabrication of Compliant Cellular Materials with Graded Stiffness

Typically, cellular materials are designed for structural applications to provide stiffness or absorb impact via permanent plastic deformation. Alternatively, it is possible to design compliant cellular materials that absorb energy via recoverable elastic deformation, allowing the material to spring back to its original configuration after the load is released. Potential applications include automotive panels or prosthetic applications that require repeated, low-speed impact absorption without permanent deformation. The key is to arrange solid base material in cellular topologies that permit high levels of elastic deformation. To prevent plastic deformation, the topologies are designed for contact between cell walls at predetermined load levels, resulting in customized, graded stiffness profiles. Design techniques are established for synthesizing cellular topologies with customized compliance for static or quasi-static applications. The design techniques account for cell wall contact, large scale deformations, and material nonlinearities. Resulting cellular material designs are fabricated with selective laser sintering, and their properties are experimentally evaluated.Mechanical Engineerin

Designing Volumetric Truss Structures

We present the first algorithm for designing volumetric Michell Trusses. Our method uses a parametrization approach to generate trusses made of structural elements aligned with the primary direction of an object's stress field. Such trusses exhibit high strength-to-weight ratios. We demonstrate the structural robustness of our designs via a posteriori physical simulation. We believe our algorithm serves as an important complement to existing structural optimization tools and as a novel standalone design tool itself

Practical Block-wise Neural Network Architecture Generation

Convolutional neural networks have gained a remarkable success in computer vision. However, most usable network architectures are hand-crafted and usually require expertise and elaborate design. In this paper, we provide a block-wise network generation pipeline called BlockQNN which automatically builds high-performance networks using the Q-Learning paradigm with epsilon-greedy exploration strategy. The optimal network block is constructed by the learning agent which is trained sequentially to choose component layers. We stack the block to construct the whole auto-generated network. To accelerate the generation process, we also propose a distributed asynchronous framework and an early stop strategy. The block-wise generation brings unique advantages: (1) it performs competitive results in comparison to the hand-crafted state-of-the-art networks on image classification, additionally, the best network generated by BlockQNN achieves 3.54% top-1 error rate on CIFAR-10 which beats all existing auto-generate networks. (2) in the meanwhile, it offers tremendous reduction of the search space in designing networks which only spends 3 days with 32 GPUs, and (3) moreover, it has strong generalizability that the network built on CIFAR also performs well on a larger-scale ImageNet dataset.Comment: Accepted to CVPR 201

Accelerated search and design of stretchable graphene kirigami using machine learning

Making kirigami-inspired cuts into a sheet has been shown to be an effective way of designing stretchable materials with metamorphic properties where the 2D shape can transform into complex 3D shapes. However, finding the optimal solutions is not straightforward as the number of possible cutting patterns grows exponentially with system size. Here, we report on how machine learning (ML) can be used to approximate the target properties, such as yield stress and yield strain, as a function of cutting pattern. Our approach enables the rapid discovery of kirigami designs that yield extreme stretchability as verified by molecular dynamics (MD) simulations. We find that convolutional neural networks, commonly used for classification in vision tasks, can be applied for regression to achieve an accuracy close to the precision of the MD simulations. This approach can then be used to search for optimal designs that maximize elastic stretchability with only 1000 training samples in a large design space of ∼4×106 candidate designs. This example demonstrates the power and potential of ML in finding optimal kirigami designs at a fraction of iterations that would be required of a purely MD or experiment-based approach, where no prior knowledge of the governing physics is known or available.P. Z. H. developed the codes, performed the simulations and data analysis, and wrote the manuscript with input from all authors. P. Z. H. and E. D. C. developed the machine learning methods. P. Z. H., D. K. C. and H. S. P. acknowledge the Hariri Institute Research Incubation Grant No. 2018-02-002 and the Boston University High Performance Shared Computing Cluster. P. Z. H. is grateful for the Hariri Graduate Fellowship. P. Z. H. thank Grace Gu and Adrian Yi for helpful discussions. (2018-02-002 - Hariri Graduate Fellowship)Published versio

Inductive queries for a drug designing robot scientist

It is increasingly clear that machine learning algorithms need to be integrated in an iterative scientific discovery loop, in which data is queried repeatedly by means of inductive queries and where the computer provides guidance to the experiments that are being performed. In this chapter, we summarise several key challenges in achieving this integration of machine learning and data mining algorithms in methods for the discovery of Quantitative Structure Activity Relationships (QSARs). We introduce the concept of a robot scientist, in which all steps of the discovery process are automated; we discuss the representation of molecular data such that knowledge discovery tools can analyse it, and we discuss the adaptation of machine learning and data mining algorithms to guide QSAR experiments