Clotting Mimicry from Robust Hemostatic Bandages Based on Self-Assembling Peptides by Tschabrunn, Cory M., Mehta, Manav, Perez-Cuevas, Monica B., Zhang, Shuguang, Hsu, Bryan Boen, Conway, William E., Hammond, Paula T

Get full text

Ultra-low energy electronics for synthetic biological sensors by Nadeau, Phillip Michel

Get full text

Digital Morphing Wing: Active Wing Shaping Concept Using Composite Lattice-Based Cellular Structures by Cellucci, Daniel, Cramer, Nick, Swei, Sean, Cheung, Kenneth C., Jenett, Benjamin Eric, Calisch, Samuel Eli, Gershenfeld, Neil A

Get full text
Get full text
Get full text
Get full text

Sub-linear algorithms for graph problems by Yodpinyanee, Anak

Get full text

Searching without communicating: tradeoffs between performance and selection complexity by Lenzen, Christoph, Lynch, Nancy, Newport, Calvin, Radeva, Tsvetomira

“…In more detail, we propose a new selection complexity metric χ, defined for algorithm A such that χ(A) = b+ log ℓ, where b is the number of memory bits used by each agent and ℓ bounds the fineness of available probabilities (agents use probabilities of at least 1 / 2 ℓ). …”
Get full text

The orthogonal vectors conjecture for branching programs and formulas by Kane, Daniel, Williams, Richard Ryan

“…We give a sense in which independent random restrictions cannot be used to show hardness, in that OVC is false in the “average case” even for AC0 formulas: For all p ∈ (0, 1) there is a δp > 0 such that for every n and d, OV instances with input bits independently set to 1 with probability p (and 0 otherwise) can be solved with AC0 formulas of O(n2−δp ) size, on all but a on(1) fraction of instances. …”
Get full text

Memory Checking Requires Logarithmic Overhead by Boyle, Elette, Komargodski, Ilan, Vafa, Neekon

Get full text

Minimum distance of error correcting codes versus encoding complexity, symmetry, and pseudorandomness by Bazzi, Louay Mohamad Jamil, 1974-

Get full text

An efficient buffer management methods for Cachet by Kim, Byungsub, 1978-

Get full text

Advances in signatures, encryption, and E-Cash from bilinear groups by Hohenberger, Susan Rae, 1978-

Get full text

Street media : ambient messages in an urban space by Murthy, Rekha (Rekha S.)

Get full text
Get full text

Magnetic properties of small multi-layered rings by Jung, Wonjoon

Get full text

Study of substrate noise and techniques for minimization by Peng, Mark Shane, 1975-

Get full text

RFID as a key enabler of the internet of things : localization and communication by Wang, Jue, 1986-

Get full text

Performative autobiography as design attitude : the Merz-World of Kurt Schwitters by Vardouli, Rodanthi, Schwitters, Kurt, 1887-1948

Get full text

Spintronics based random access memory : a review by Bhatti, Sabpreet, Sbiaa, Rachid, Hirohata, Atsufumi, Ohno, Hideo, Fukami, Shunsuke, Piramanayagam, S. N.

“…Reading information from MRAM, the technologies, materials and the physics behind reading of bits in MRAM are described in detail. As a next step, the physics and technologies involved in writing information are described. …”
Get full text

Beamforming strategies in wireless multi-antenna communication systems by Zhang, Zhiyu

“…The CS measurement is modelled as a quantization procedure in which quantization noises are generated according to the number of feedback bits. The original channel can be recovered with high accuracy by solving an optimization problem at the BS. …”
Get full text

Correlation in hard distributions in communication complexity by Klauck, Hartmut, Bottesch, Ralph Christian, Gavinsky, Dmitry

“…The upper bounds improve and generalise what was known for product distributions, and imply that any tight bound for Disjointness needs Omega(n) bits of mutual information in the corresponding distribution. - We study the same question in the distributional quantum setting, and show a lower bound of Omega((n(k+1))^{1/4}), and an upper bound (via constructing communication protocols), matching up to a logarithmic factor. - We show that there are total Boolean functions f_d that have distributional communication complexity O(log(n)) under all distributions of information up to o(n), while the (interactive) distributional complexity maximised over all distributions is Theta(log(d)) for n <= d <= 2^{n/100}. …”
Get full text
Get full text

Approximate pure nash equilibria in weighted congestion games: existence, efficient computation, and structure by Caragiannis, Ioannis, Fanelli, Angelo, Gravin, Nick, Skopalik, Alexander

“…The running time is polynomial in the number of bits in the representation of the game and 1/γ. As a byproduct of our techniques, we also show the following interesting structural statement for weighted congestion games with polynomial latency functions of maximum degree d ≥ 2: polynomially-long sequences of best-response moves from any initial state to a d O(d2)-approximate pure Nash equilibrium exist and can be efficiently identified in such games as long as d is constant. …”
Get full text
Get full text

Quantification of submerged seagrass total aboveground biomass in Malaysian coastal waters using remote sensing data by Misbari, Syarifuddin

Get full text