A bidirectional lens-free digital-bits-in/-out 0.57mm2 terahertz nano-radio in CMOS with 49.3mW Peak power consumption supporting 50cm Internet-of-Things communication

Author(s):  
Taiyun Chi ◽  
Hechen Wang ◽  
Min-Yu Huang ◽  
Fa Foster Dai ◽  
Hua Wang
2021 ◽  
Vol 7 ◽  
pp. 458-468
Author(s):  
Dongwen Chen ◽  
Xiao Hu ◽  
Yong Li ◽  
Jingcheng Chen ◽  
Ruzhu Wang

2020 ◽  
Vol 10 (5) ◽  
pp. 1627 ◽  
Author(s):  
Himanshu Nagpal ◽  
Andrea Staino ◽  
Biswajit Basu

In this work, an algorithm for the scheduling of household appliances to reduce the energy cost and the peak-power consumption is proposed. The system architecture of a home energy management system (HEMS) is presented to operate the appliances. The dynamics of thermal and non-thermal appliances is represented into state-space model to formulate the scheduling task into a mixed-integer-linear-programming (MILP) optimization problem. Model predictive control (MPC) strategy is used to operate the appliances in real-time. The HEMS schedules the appliances in dynamic manner without any a priori knowledge of the load-consumption pattern. At the same time, the HEMS responds to the real-time electricity market and the external environmental conditions (solar radiation, ambient temperature, etc.). Simulation results exhibit the benefits of the proposed HEMS by showing the reduction of up to 70% in electricity cost and up to 57% in peak power consumption.


2013 ◽  
Vol 206 (1) ◽  
pp. 115-145 ◽  
Author(s):  
Kan Fang ◽  
Nelson A. Uhan ◽  
Fu Zhao ◽  
John W. Sutherland

2011 ◽  
Vol 22 (08) ◽  
pp. 1829-1844 ◽  
Author(s):  
MANFRED DROSTE ◽  
INGMAR MEINECKE

Quantitative aspects of systems like consumption of resources, output of goods, or reliability can be modeled by weighted automata. Recently, objectives like the average cost or the longtime peak power consumption of a system have been modeled by weighted automata which are not semiring weighted anymore. Instead, operations like limit superior, limit average, or discounting are used to determine the behavior of these automata. Here, we introduce a new class of weight structures subsuming a range of these models as well as semirings. Our main result shows that such weighted automata and Kleene-type regular expressions are expressively equivalent both for finite and infinite words.


Sign in / Sign up

Export Citation Format

Share Document