Search results for "System Modeling"
showing 4 items of 14 documents
LightSleepNet: A Lightweight Deep Model for Rapid Sleep Stage Classification with Spectrograms.
2021
Deep learning has achieved unprecedented success in sleep stage classification tasks, which starts to pave the way for potential real-world applications. However, due to its enormous size, deployment of deep neural networks is hindered by high cost at various aspects, such as computation power, storage, network bandwidth, power consumption, and hardware complexity. For further practical applications (e.g., wearable sleep monitoring devices), there is a need for simple and compact models. In this paper, we propose a lightweight model, namely LightSleepNet, for rapid sleep stage classification based on spectrograms. Our model is assembled by a much fewer number of model parameters compared to…
Experimental test on a fuel cell-supercapacitor hybrid power supply for a digital still camera
2009
Chaos and its Degradation-Promoting-Based Control in an Antithetic Integral Feedback Circuit
2022
This letter deals with a novel variant of antithetic integral feedback controller (AIFC) motifs which can feature robust perfect adaptation, a pervasive (desired) ability in natural (synthetic) biomolecular circuits, when coupled with a wide class of process networks to be regulated. Using the separation of timescales in the proposed kind of AIFC, here we find a reducedorder controller that captures the governing slow part of the original solutions under suitable assumptions. Inspired by R(ossler systems, we then make use of such a simpler controller to show that the antithetic circuit can exhibit chaotic behaviors with strange attractors, where the bifurcation from a homeostatic state to c…
Time-Dependent Multiple Depot Vehicle Routing Problem on Megapolis Network under Wardrop's Traffic Flow Assignment
2018
In this work multiple depot vehicle routing problem is considered in case of variable travel times between nodes on a metropolis network. This variant of the classic multiple depot vehicle routing problem is motivated by the fact that in urban contexts variable traffic conditions play an essential role and can not be ignored in order to perform a realistic optimization. Time-travel matrices corresponding to each period of planning horizon were formed by solving the traffic assignment problem in conjunction with shortest path problem. Routing problem instances include from 20 to 100 customers randomly chosen from a road network of Saint-Petersburg. The results demonstrate that taking into ac…