7,452 research outputs found

    3D Printing Variable Stiffness Foams Using Viscous Thread Instability

    Get PDF
    Additive manufacturing of cellular structures has numerous applications ranging from fabrication of biological scaffolds and medical implants, to mechanical weight reduction and control over mechanical properties. Various additive manufacturing processes have been used to produce open regular cellular structures limited only by the resolution of the printer. These efforts have focused on printing explicitly designed cells or explicitly planning offsets between strands. Here we describe a technique for producing cellular structures implicitly by inducing viscous thread instability when extruding material. This process allows us to produce complex cellular structures at a scale that is finer than the native resolution of the printer. We demonstrate tunable effective elastic modulus and density that span two orders of magnitude. Fine grained cellular structures allow for fabrication of foams for use in a wide range of fields ranging from bioengineering, to robotics to food printing.United States. Department of Defense (Grant W81XWH-13-C-0081

    High rate locally-correctable and locally-testable codes with sub-polynomial query complexity

    Full text link
    In this work, we construct the first locally-correctable codes (LCCs), and locally-testable codes (LTCs) with constant rate, constant relative distance, and sub-polynomial query complexity. Specifically, we show that there exist binary LCCs and LTCs with block length nn, constant rate (which can even be taken arbitrarily close to 1), constant relative distance, and query complexity exp(O~(logn))\exp(\tilde{O}(\sqrt{\log n})). Previously such codes were known to exist only with Ω(nβ)\Omega(n^{\beta}) query complexity (for constant β>0\beta > 0), and there were several, quite different, constructions known. Our codes are based on a general distance-amplification method of Alon and Luby~\cite{AL96_codes}. We show that this method interacts well with local correctors and testers, and obtain our main results by applying it to suitably constructed LCCs and LTCs in the non-standard regime of \emph{sub-constant relative distance}. Along the way, we also construct LCCs and LTCs over large alphabets, with the same query complexity exp(O~(logn))\exp(\tilde{O}(\sqrt{\log n})), which additionally have the property of approaching the Singleton bound: they have almost the best-possible relationship between their rate and distance. This has the surprising consequence that asking for a large alphabet error-correcting code to further be an LCC or LTC with exp(O~(logn))\exp(\tilde{O}(\sqrt{\log n})) query complexity does not require any sacrifice in terms of rate and distance! Such a result was previously not known for any o(n)o(n) query complexity. Our results on LCCs also immediately give locally-decodable codes (LDCs) with the same parameters

    Does Scientific Progress Consist in Increasing Knowledge or Understanding?

    Get PDF
    Bird argues that scientific progress consists in increasing knowledge. Dellsén objects that increasing knowledge is neither necessary nor sufficient for scientific progress, and argues that scientific progress rather consists in increasing understanding. Dellsén also contends that unlike Bird’s view, his view can account for the scientific practices of using idealizations and of choosing simple theories over complex ones. I argue that Dellsén’s criticisms against Bird’s view fail, and that increasing understanding cannot account for scientific progress, if acceptance, as opposed to belief, is required for scientific understanding

    Bond-Propagation Algorithm for Thermodynamic Functions in General 2D Ising Models

    Full text link
    Recently, we developed and implemented the bond propagation algorithm for calculating the partition function and correlation functions of random bond Ising models in two dimensions. The algorithm is the fastest available for calculating these quantities near the percolation threshold. In this paper, we show how to extend the bond propagation algorithm to directly calculate thermodynamic functions by applying the algorithm to derivatives of the partition function, and we derive explicit expressions for this transformation. We also discuss variations of the original bond propagation procedure within the larger context of Y-Delta-Y-reducibility and discuss the relation of this class of algorithm to other algorithms developed for Ising systems. We conclude with a discussion on the outlook for applying similar algorithms to other models.Comment: 12 pages, 10 figures; submitte

    Nuclear-spin relaxation of 207^{207}Pb in ferroelectric powders

    Full text link
    Motivated by a recent proposal by O. P. Sushkov and co-workers to search for a P,T-violating Schiff moment of the 207^{207}Pb nucleus in a ferroelectric solid, we have carried out a high-field nuclear magnetic resonance study of the longitudinal and transverse spin relaxation of the lead nuclei from room temperature down to 10 K for powder samples of lead titanate (PT), lead zirconium titanate (PZT), and a PT monocrystal. For all powder samples and independently of temperature, transverse relaxation times were found to be T21.5T_2\approx 1.5 ms, while the longitudinal relaxation times exhibited a temperature dependence, with T1T_1 of over an hour at the lowest temperatures, decreasing to T17T_1\approx 7 s at room temperature. At high temperatures, the observed behavior is consistent with a two-phonon Raman process, while in the low temperature limit, the relaxation appears to be dominated by a single-phonon (direct) process involving magnetic impurities. This is the first study of temperature-dependent nuclear-spin relaxation in PT and PZT ferroelectrics at such low temperatures. We discuss the implications of the results for the Schiff-moment search.Comment: 6 pages, 4 figure

    Migration of Mouse 3T3 Fibroblasts in Response to a Serum Factor

    Full text link
    corecore