Stationary Cycling Induced by Switched Functional Electrical Stimulation Control

Functional electrical stimulation (FES) is used to activate the dysfunctional lower limb muscles of individuals with neuromuscular disorders to produce cycling as a means of exercise and rehabilitation. However, FES-cycling is still metabolically inefficient and yields low power output at the cycle crank compared to able-bodied cycling. Previous literature suggests that these problems are symptomatic of poor muscle control and non-physiological muscle fiber recruitment. The latter is a known problem with FES in general, and the former motivates investigation of better control methods for FES-cycling.In this paper, a stimulation pattern for quadriceps femoris-only FES-cycling is derived based on the effectiveness of knee joint torque in producing forward pedaling. In addition, a switched sliding-mode controller is designed for the uncertain, nonlinear cycle-rider system with autonomous state-dependent switching. The switched controller yields ultimately bounded tracking of a desired trajectory in the presence of an unknown, time-varying, bounded disturbance, provided a reverse dwell-time condition is satisfied by appropriate choice of the control gains and a sufficient desired cadence. Stability is derived through Lyapunov methods for switched systems, and experimental results demonstrate the performance of the switched control system under typical cycling conditions.Comment: 8 pages, 3 figures, submitted to ACC 201

Ising Anyons in Frustration-Free Majorana-Dimer Models

Dimer models have long been a fruitful playground for understanding topological physics. Here we introduce a new class - termed Majorana-dimer models - wherein bosonic dimers are decorated with pairs of Majorana modes. We find that the simplest examples of such systems realize an intriguing, intrinsically fermionic phase of matter that can be viewed as the product of a chiral Ising theory, which hosts deconfined non-Abelian quasiparticles, and a topological $p_x - ip_y$ superconductor. While the bulk anyons are described by a single copy of the Ising theory, the edge remains fully gapped. Consequently, this phase can arise in exactly solvable, frustration-free models. We describe two parent Hamiltonians: one generalizes the well-known dimer model on the triangular lattice, while the other is most naturally understood as a model of decorated fluctuating loops on a honeycomb lattice. Using modular transformations, we show that the ground-state manifold of the latter model unambiguously exhibits all properties of the $\text{Ising} \times (p_x-ip_y)$ theory. We also discuss generalizations with more than one Majorana mode per site, which realize phases related to Kitaev's 16-fold way in a similar fashion

Quantified Derandomization of Linear Threshold Circuits

One of the prominent current challenges in complexity theory is the attempt to prove lower bounds for $TC^0$, the class of constant-depth, polynomial-size circuits with majority gates. Relying on the results of Williams (2013), an appealing approach to prove such lower bounds is to construct a non-trivial derandomization algorithm for $TC^0$. In this work we take a first step towards the latter goal, by proving the first positive results regarding the derandomization of $TC^0$ circuits of depth $d>2$. Our first main result is a quantified derandomization algorithm for $TC^0$ circuits with a super-linear number of wires. Specifically, we construct an algorithm that gets as input a $TC^0$ circuit $C$ over $n$ input bits with depth $d$ and $n^{1+\exp(-d)}$ wires, runs in almost-polynomial-time, and distinguishes between the case that $C$ rejects at most $2^{n^{1-1/5d}}$ inputs and the case that $C$ accepts at most $2^{n^{1-1/5d}}$ inputs. In fact, our algorithm works even when the circuit $C$ is a linear threshold circuit, rather than just a $TC^0$ circuit (i.e., $C$ is a circuit with linear threshold gates, which are stronger than majority gates). Our second main result is that even a modest improvement of our quantified derandomization algorithm would yield a non-trivial algorithm for standard derandomization of all of $TC^0$, and would consequently imply that $NEXP\not\subseteq TC^0$. Specifically, if there exists a quantified derandomization algorithm that gets as input a $TC^0$ circuit with depth $d$ and $n^{1+O(1/d)}$ wires (rather than $n^{1+\exp(-d)}$ wires), runs in time at most $2^{n^{\exp(-d)}}$, and distinguishes between the case that $C$ rejects at most $2^{n^{1-1/5d}}$ inputs and the case that $C$ accepts at most $2^{n^{1-1/5d}}$ inputs, then there exists an algorithm with running time $2^{n^{1-\Omega(1)}}$ for standard derandomization of $TC^0$.Comment: Changes in this revision: An additional result (a PRG for quantified derandomization of depth-2 LTF circuits); rewrite of some of the exposition; minor correction

Qigong for the Management of Type 2 Diabetes Mellitus

Type 2 diabetes mellitus (T2MD) is a complex, chronic, metabolic disease with hyperglycemia arising from insulin resistance, progressive pancreatic beta cell failure, insufficient insulin secretion and increased hepatic glucose output. In the Chinese medicine theory, T2DM is often referred to as a form of Xiao Ke (消渴) or “wasting‐thirst disorder.” Genetic, dietary, lifestyle and environmental factors play a role in T2DM. People with a family history of diabetes or who are obese are at the highest risk of developing the disease. T2DM is often associated with hypertension, dyslipidemia and atherosclerosis and if not managed can lead to complications including cerebrovascular accident, peripheral vascular disease and nephropathy. T2DM can be well managed with biomedical and Chinese medicine treatment approaches. Lifestyle changes including appropriate diet and exercise are paramount in managing T2DM. Regular Qigong practice can be a beneficial part of one\u27s exercise routine for T2DM self‐care. Qigong exercise has shown promising results in clinical experience and in randomized, controlled pilot studies for affecting aspects of T2DM including positive associations between participation in Qigong and blood glucose, triglycerides, total cholesterol, weight, BMI and insulin resistance. This chapter looks at how traditional Chinese medicine (TCM) views diabetes as well as new understandings of how Qigong can support the management of T2DM

A Lightweight Implementation of NTRUEncrypt for 8-bit AVR Microcontrollers

Introduced in 1996, NTRUEncrypt is not only one of the earliest but also one of the most scrutinized lattice-based cryptosystems and a serious contender in NIST’s ongoing Post-Quantum Cryptography (PQC) standardization project. An important criterion for the assessment of candidates is their computational cost in various hardware and software environments. This paper contributes to the evaluation of NTRUEncrypt on the ATmega class of AVR microcontrollers, which belongs to the most popular 8-bit platforms in the embedded domain. More concretely, we present AvrNtru, a carefully-optimized implementation of NTRUEncrypt that we developed from scratch with the goal of achieving high performance and resistance to timing attacks. AvrNtru complies with version 3.3 of the EESS#1 specification and supports recent product-form parameter sets like ees443ep1, ees587ep1, and ees743ep1. A full encryption operation (including mask generation and blinding- polynomial generation) using the ees443ep1 parameters takes 834,272 clock cycles on an ATmega1281 microcontroller; the decryption is slightly more costly and has an execution time of 1,061,683 cycles. When choosing the ees743ep1 parameters to achieve a 256-bit security level, 1,539,829 clock cycles are cost for encryption and 2,103,228 clock cycles for decryption. We achieved these results thanks to a novel hybrid technique for multiplication in truncated polynomial rings where one of the operands is a sparse ternary polynomial in product form. Our hybrid technique is inspired by Gura et al’s hybrid method for multiple-precision integer multiplication (CHES 2004) and takes advantage of the large register file of the AVR architecture to minimize the number of load instructions. A constant-time multiplication in the ring specified by the ees443ep1 parameters requires only 210,827 cycles, which sets a new speed record for the arithmetic component of a lattice-based cryptosystem on an 8-bit microcontroller