Bearing and gimbal lock mechanism and spiral flex lead module Patent

Low friction bearing and lock mechanism for two-axis gimbal carrying satellite payloa

VALUING LOSSES FROM DEPOPULATING MICHIGAN DAIRY HERDS

Depopulating dairy herds in the effort to eradicate disease would have significant economic effects. This paper evaluates farm-level effects that might occur and puts forth a method for quantifying losses. The reader is directed elsewhere for industry or state-level effects of disease eradication or depopulation.Livestock Production/Industries,

Probabilities on Sentences in an Expressive Logic

Automated reasoning about uncertain knowledge has many applications. One difficulty when developing such systems is the lack of a completely satisfactory integration of logic and probability. We address this problem directly. Expressive languages like higher-order logic are ideally suited for representing and reasoning about structured knowledge. Uncertain knowledge can be modeled by using graded probabilities rather than binary truth-values. The main technical problem studied in this paper is the following: Given a set of sentences, each having some probability of being true, what probability should be ascribed to other (query) sentences? A natural wish-list, among others, is that the probability distribution (i) is consistent with the knowledge base, (ii) allows for a consistent inference procedure and in particular (iii) reduces to deductive logic in the limit of probabilities being 0 and 1, (iv) allows (Bayesian) inductive reasoning and (v) learning in the limit and in particular (vi) allows confirmation of universally quantified hypotheses/sentences. We translate this wish-list into technical requirements for a prior probability and show that probabilities satisfying all our criteria exist. We also give explicit constructions and several general characterizations of probabilities that satisfy some or all of the criteria and various (counter) examples. We also derive necessary and sufficient conditions for extending beliefs about finitely many sentences to suitable probabilities over all sentences, and in particular least dogmatic or least biased ones. We conclude with a brief outlook on how the developed theory might be used and approximated in autonomous reasoning agents. Our theory is a step towards a globally consistent and empirically satisfactory unification of probability and logic.Comment: 52 LaTeX pages, 64 definiton/theorems/etc, presented at conference Progic 2011 in New Yor

Exponential complexity of an adiabatic algorithm for an NP-complete problem

We prove an analytical expression for the size of the gap between the ground and the first excited state of quantum adiabatic algorithm for the 3-satisfiability, where the initial Hamiltonian is a projector on the subspace complementary to the ground state. For large problem sizes the gap decreases exponentially and as a consequence the required running time is also exponential.Comment: 5 pages, 2 figures; v3. published versio

Monolayer MoS2 strained to 1.3% with a microelectromechanical system

We report on a modified transfer technique for atomically thin materials integrated onto microelectromechanical systems (MEMS) for studying strain physics and creating strain-based devices. Our method tolerates the non-planar structures and fragility of MEMS, while still providing precise positioning and crack free transfer of flakes. Further, our method used the transfer polymer to anchor the 2D crystal to the MEMS, which reduces the fabrication time, increases the yield, and allowed us to exploit the strong mechanical coupling between 2D crystal and polymer to strain the atomically thin system. We successfully strained single atomic layers of molybdenum disulfide (MoS2) with MEMS devices for the first time and achieved greater than 1.3% strain, marking a major milestone for incorporating 2D materials with MEMS We used the established strain response of MoS2 Raman and Photoluminescence spectra to deduce the strain in our crystals and provide a consistency check. We found good comparison between our experiment and literature.Published versio

Towards practical classical processing for the surface code

The surface code is unarguably the leading quantum error correction code for 2-D nearest neighbor architectures, featuring a high threshold error rate of approximately 1%, low overhead implementations of the entire Clifford group, and flexible, arbitrarily long-range logical gates. These highly desirable features come at the cost of significant classical processing complexity. We show how to perform the processing associated with an nxn lattice of qubits, each being manipulated in a realistic, fault-tolerant manner, in O(n^2) average time per round of error correction. We also describe how to parallelize the algorithm to achieve O(1) average processing per round, using only constant computing resources per unit area and local communication. Both of these complexities are optimal.Comment: 5 pages, 6 figures, published version with some additional tex