Georgia Institute of Technology

About: Georgia Institute of Technology is a education organization based out in Atlanta, Georgia, United States. It is known for research contribution in the topics: Population & Computer science. The organization has 45387 authors who have published 119086 publications receiving 4651220 citations.

Multimaterial 4D Printing with Tailorable Shape Memory Polymers

Abstract: We present a new 4D printing approach that can create high resolution (up to a few microns), multimaterial shape memory polymer (SMP) architectures The approach is based on high resolution projection microstereolithography (PμSL) and uses a family of photo-curable methacrylate based copolymer networks We designed the constituents and compositions to exhibit desired thermomechanical behavior (including rubbery modulus, glass transition temperature and failure strain which is more than 300% and larger than any existing printable materials) to enable controlled shape memory behavior We used a high resolution, high contrast digital micro display to ensure high resolution of photo-curing methacrylate based SMPs that requires higher exposure energy than more common acrylate based polymers An automated material exchange process enables the manufacture of 3D composite architectures from multiple photo-curable SMPs In order to understand the behavior of the 3D composite microarchitectures, we carry out high fidelity computational simulations of their complex nonlinear, time-dependent behavior and study important design considerations including local deformation, shape fixity and free recovery rate Simulations are in good agreement with experiments for a series of single and multimaterial components and can be used to facilitate the design of SMP 3D structures

Theory of Sliding‐Mode Triboelectric Nanogenerators

Abstract: The triboelectric nanogenerator (TENG) is a powerful approach toward new energy technology, especially for portable electronics. A theoretical model for the sliding-mode TENG is presented in this work. The finite element method was utilized to characterize the distributions of electric potential, electric field, and charges on the metal electrodes of the TENG. Based on the FEM calculation, the semi-analytical results from the interpolation method and the analytical V-Q-x relationship are built to study the sliding-mode TENG. The analytical V-Q-x equation is validated through comparison with the semi-analytical results. Furthermore, based on the analytical V-Q-x equation, dynamic output performance of sliding-mode TENG is calculated with arbitrary load resistance, and good agreement with experimental data is achieved. The theory presented here is a milestone work for in-depth understanding of the working mechanism of the sliding-mode TENG, and provides a theoretical basis for further enhancement of the sliding-mode TENG for both energy scavenging and self-powered sensor applications.

Approaching the dirac point in high-mobility multilayer epitaxial graphene.

Abstract: Multilayer epitaxial graphene is investigated using far infrared transmission experiments in the different limits of low magnetic fields and high temperatures. The cyclotron-resonance-like absorption is observed at low temperature in magnetic fields below 50 mT, probing the nearest vicinity of the Dirac point. The carrier mobility is found to exceed 250,000 cm2/(V x s). In the limit of high temperatures, the well-defined Landau level quantization is observed up to room temperature at magnetic fields below 1 T, a phenomenon unusual in solid state systems. A negligible increase in the width of the cyclotron resonance lines with increasing temperature indicates that no important scattering mechanism is thermally activated.

Delegating computation: interactive proofs for muggles

Abstract: In this work we study interactive proofs for tractable languages. The (honest) prover should be efficient and run in polynomial time, or in other words a "muggle". The verifier should be super-efficient and run in nearly-linear time. These proof systems can be used for delegating computation: a server can run a computation for a client and interactively prove the correctness of the result. The client can verify the result's correctness in nearly-linear time (instead of running the entire computation itself). Previously, related questions were considered in the Holographic Proof setting by Babai, Fortnow, Levin and Szegedy, in the argument setting under computational assumptions by Kilian, and in the random oracle model by Micali. Our focus, however, is on the original interactive proof model where no assumptions are made on the computational power or adaptiveness of dishonest provers. Our main technical theorem gives a public coin interactive proof for any language computable by a log-space uniform boolean circuit with depth d and input length n. The verifier runs in time (n+d) • polylog(n) and space O(log(n)), the communication complexity is d • polylog(n), and the prover runs in time poly(n). In particular, for languages computable by log-space uniform NC (circuits of polylog(n) depth), the prover is efficient, the verifier runs in time n • polylog(n) and space O(log(n)), and the communication complexity is polylog(n). Using this theorem we make progress on several questions: We show how to construct short (polylog size) computationally sound non-interactive certificates of correctness for any log-space uniform NC computation, in the public-key model. The certificates can be verified in quasi-linear time and are for a designated verifier: each certificate is tailored to the verifier's public key. This result uses a recent transformation of Kalai and Raz from public-coin interactive proofs to one-round arguments. The soundness of the certificates is based on the existence of a PIR scheme with polylog communication. Interactive proofs with public-coin, log-space, poly-time verifiers for all of P. This settles an open question regarding the expressive power of proof systems with such verifiers. Zero-knowledge interactive proofs with communication complexity that is quasi-linear in the witness, length for any NP language verifiable in NC, based on the existence of one-way functions. Probabilistically checkable arguments (a model due to Kalai and Raz) of size polynomial in the witness length (rather than the instance length) for any NP language verifiable in NC, under computational assumptions.

Interfacial microfluidic processing of metal-organic framework hollow fiber membranes

Abstract: Molecular sieving metal-organic framework (MOF) membranes have great potential for energy-efficient chemical separations, but a major hurdle is the lack of a scalable and inexpensive membrane fabrication mechanism. We describe a route for processing MOF membranes in polymeric hollow fibers, combining a two-solvent interfacial approach for positional control over membrane formation (at inner and outer surfaces, or in the bulk, of the fibers), a microfluidic approach to replenishment or recycling of reactants, and an in situ module for membrane fabrication and permeation. We fabricated continuous molecular sieving ZIF-8 membranes in single and multiple poly(amide-imide) hollow fibers, with H2/C3H8 and C3H6/C3H8 separation factors as high as 370 and 12, respectively. We also demonstrate positional control of the ZIF-8 films and characterize the contributions of membrane defects and lumen bypass.