Deformable electronics have found various applications and elastomeric materials have been widely used to reach flexibility and stretchability. In this Letter, we report an alternative approach to enable deformability through origami. In this approach, the deformability is achieved through folding and unfolding at the creases while the functional devices do not experience strain. We have demonstrated an example of origami-enabled silicon solar cells and showed that this solar cell can reach up to 644% areal compactness while maintaining reasonable good performance upon cyclic folding/unfolding. This approach opens an alternative direction of producing flexible, stretchable, and deformable electronics. V

This letter reports the realization of bendable inductors and capacitors integrated on a polyethylene terephthalate substrate that can operate at high microwave frequencies. A low-temperature fabrication process compatible with flexible thin-film transistors ͑TFTs͒ was developed. By employing bendable dielectric materials, spiral inductors and metal-insulator-metal capacitors with high quality factors and high resonance frequencies were demonstrated. The effects of mechanical bending on the performance of inductors and capacitors were also measured and analyzed. These demonstrations combined with previously demonstrated microwave TFTs will lead to flexible radio-frequency and microwave systems in the future.

This article reviews the development of a new category of motion sensors including linear and angular accelerometers and seismometers based on molecular electronic transducer (MET) technology. This technology utilizes a liquid not only as an inertial mass, but also as one of the main elements in the conversion of mechanical motion into electric current. The amplification process is similar to that in a vacuum triode. Therefore, it is possible to achieve signal amplification close to 108. Motion sensors demonstrating wide frequency and dynamic range and sensitivity that are one to two orders of magnitude better than MEMS devices of the same size have been developed.

No abstract

The main contributions of this paper are two-fold. First, we present a simple, general framework for obtaining efficient constant-factor approximation algorithms for the mobile piercing set (MPS) problem on unit-disks for standard metrics in fixed dimension vector spaces. More specifically, we provide low constant approximations for L1-and L∞-norms on a d-dimensional space, for any fixed d > 0, and for the L2-norm on 2-and 3-dimensional spaces. Our framework provides a family of fully-distributed and decentralized algorithms, which adapts (asymptotically) optimally to the mobility of disks, at the expense of a low degradation on the best known approximation factors of the respective centralized algorithms: Our algorithms take O(1) time to update the piercing set maintained, per movement of a disk. We also present a family of fully-distributed algorithms for the MPS problem which either match or improve the best known approximation bounds of centralized algorithms for the respective norms and dimensions.Second, we show how the proposed algorithms can be directly applied to provide theoretical performance analyses for two popular 1-hop clustering algorithms in ad-hoc networks: the lowest-id algorithm and the Least Cluster Change (LCC) algorithm. More specifically, we formally prove that the LCC algorithm adapts in constant time to the mobility of the network nodes, and minimizes (up to low constant factors) the number of 1-hop clusters maintained; we propose an alternative algorithm to the lowest-id algorithm which achieves a better approximation factor without increasing the cost of adapting to changes in the network * topology. While there is a vast literature on simulation results for the LCC and the lowest-id algorithms, these had not been formally analysed prior to this work.We also present an O(log n)-approximation algorithm for the mobile piercing set problem for nonuniform disks (i.e., disks that may have different radii), with constant update time.