BackgroundTechnological advances enable the cost-effective acquisition of Multi-Modal Data Sets (MMDS) composed of measurements for multiple, high-dimensional data types obtained from a common set of bio-samples. The joint analysis of the data matrices associated with the different data types of a MMDS should provide a more focused view of the biology underlying complex diseases such as cancer that would not be apparent from the analysis of a single data type alone. As multi-modal data rapidly accumulate in research laboratories and public databases such as The Cancer Genome Atlas (TCGA), the translation of such data into clinically actionable knowledge has been slowed by the lack of computational tools capable of analyzing MMDSs. Here, we describe the Joint Analysis of Many Matrices by ITeration (JAMMIT) algorithm that jointly analyzes the data matrices of a MMDS using sparse matrix approximations of rank-1.MethodsThe JAMMIT algorithm jointly approximates an arbitrary number of data matrices by rank-1 outer-products composed of “sparse” left-singular vectors (eigen-arrays) that are unique to each matrix and a right-singular vector (eigen-signal) that is common to all the matrices. The non-zero coefficients of the eigen-arrays identify small subsets of variables for each data type (i.e., signatures) that in aggregate, or individually, best explain a dominant eigen-signal defined on the columns of the data matrices. The approximation is specified by a single “sparsity” parameter that is selected based on false discovery rate estimated by permutation testing. Multiple signals of interest in a given MDDS are sequentially detected and modeled by iterating JAMMIT on “residual” data matrices that result from a given sparse approximation.ResultsWe show that JAMMIT outperforms other joint analysis algorithms in the detection of multiple signatures embedded in simulated MDDS. On real multimodal data for ovarian and liver cancer we show that JAMMIT identified multi-modal signatures that were clinically informative and enriched for cancer-related biology.ConclusionsSparse matrix approximations of rank-1 provide a simple yet effective means of jointly reducing multiple, big data types to a small subset of variables that characterize important clinical and/or biological attributes of the bio-samples from which the data were acquired.Electronic supplementary materialThe online version of this article (doi:10.1186/s13040-016-0103-7) contains supplementary material, which is available to authorized users.
We consider a microgrid with random load realization, stochastic renewable energy production, and an energy storage unit. The grid controller provides the total net load trajectory that the microgrid should present to the main grid and the microgrid must impose load shedding and renewable energy curtailment if necessary to meet that net load trajectory. The microgrid controller seeks to operate the local energy storage unit to minimize the risk of load shedding, and renewable energy curtailment over a finite time horizon. We formulate the problem of optimizing the operation of the storage unit as a finite stage dynamic programming problem. We prove that the multi-stage objective function of the energy storage is strictly convex in the state of charge of the battery at each stage. The uniqueness of the optimal decision is proven under some additional assumptions. The optimal strategy is then obtained. The effectiveness of the energy storage in decreasing load shedding and RE curtailment is illustrated in simulations.
At present, electricity markets largely ignore the fact that renewable power producers impose significant externalities on non-renewable energy producers. This is because consumers are generally guaranteed electricity within certain load parameters. The intermittent nature of production by renewable energy producers implies that they rely on non-renewable producers so that the aggregate power delivered meets the promised quality of service. This implicit insurance provided by the non-renewable power sector to consumers is not currently priced and leads to an often ignored, hidden monetary transfer from non-renewable producers to renewable producers. As the fraction of energy supplied by renewable resources increases, these externalities also increase. In this paper, we quantify these externalities by developing the market clearing price of energy in the presence of renewable energy. We consider a day-ahead electricity market where renewable and non-renewable generators bid by proposing their asking price per unit of energy to an independent system operator (ISO). The ISO's problem is a multi-stage stochastic optimization problem to dispatch energy from each generator to minimize the cost of purchased energy on behalf of the consumers. We incorporate the notion of load variance using the Conditional Value-at-Risk (CVAR) measure in the day-ahead electricity market to ensure that the generators are able to meet the load within a desired confidence level. We analytically derive the market clearing price of energy as a function of CVAR. It is shown that a higher penetration level of the renewable energies may increase the market clearing price of energy.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.