Moment-Based Estimation of State-Switching Rates in Cell Populations

In isogenic cell populations, cells can switch back and forth between different gene expression states. These expression states can be biologically relevant. For example, a certain expression state may cause a tumor cell to be resistant to treatment, while another state may leave it vulnerable to treatment. However, estimating the rates of state-switching can be difficult, because experimentally measuring a cell's transcriptome often involves destroying the cell, so it can only be measured once. In this paper, we propose a computational method to estimate the rate of switching between expression states, given data from a Luria-Delbrück style fluctuation test that is experimentally simple and feasible. We then benchmark this method using simulated data to test its efficacy, with varying assumptions made about cell cycle timing distribution in the simulations.

An Energy-Efficient One-Shot Scheduling Algorithm for Wireless Sensor Networks

In low-load wireless sensor networks, the power consumption of the node consists mainly of two parts: data transmission and node state switching. The lower node workload causes low energy consumption on data transmission, and the state switching energy of the node cannot be ignored. This paper proposes a one-shot time division multiple access (TMDA) scheduling with unlimited channels (SUC) on the assumption that the number of available channels is unlimited. SUC combines the receiver-based consecutive slot allocation with channel allocation, which minimises the number of node state switching and optimizes energy efficiency. Theoretical analysis demonstrates that the number of channels required by SUC does not exceed log 2 N + 1 , where N indicates the number of nodes. Seeing that the number of available wireless channels is limited in practice, the paper proposes the scheduling with limited channels (SLC) and uses a Lookahead Search mechanism to solve slot conflict. For the scalability of the algorithm, a distributed implementation based on the token change is proposed. The algorithm uses the depth-first-search (DFS) to pass the token to all nodes and terminates slot and channel assignment. The simulation results show our algorithm can reduce the energy consumption by minimizing the number of state switching and shorten the data aggregation time by reusing slots among nodes.

DC-DC 3SSC-A-Based Boost Converter: Analysis, Design, and Experimental Validation

A detailed analysis and validation of the DC-DC boost converter based on the three-state switching cell (3SSC) type-A are presented in this paper. The study of this topology is justified by the small amount of research that employs 3SSC-A and the advantages inherent to 3SSC-based converters, such as the division of current stresses between the semiconductors, the distribution of thermal losses, and the high-density power. Therefore, a complete static analysis of the converter is described, as well as the study of all voltage and current stresses in the semiconductors, the development of a loss model in all components, and a comparison with other step-up structures. Additionally, the small-signal model validation is accomplished by comparing the theoretical frequency response and the simulated AC sweep analysis. Finally, implementing a simple controller structure, the converter is experimentally validated through a 600 W prototype, where its overall efficiency is examined for various load conditions, reaching 96.8% at nominal load.