Disaggregate
Disaggregate Smart Meter data
|
addItemToEdgeHistory(const PSGraph::edge_descriptor &edge) | PowerStateGraph | [private] |
aggData | PowerStateGraph | [private] |
deviceName | PowerStateGraph | [private] |
Disag_edge_desc typedef | PowerStateGraph | [private] |
Disag_out_edge_iter typedef | PowerStateGraph | [private] |
disaggregate(const AggregateData &aggregateData, const bool keep_overlapping=false, const bool verbose=false) | PowerStateGraph | |
DisagTree typedef | PowerStateGraph | [private] |
displayAndPlotFingerprintList(const std::list< Fingerprint > &fingerprintList, const std::string &aggDataFilename) const | PowerStateGraph | [private] |
EDGE_HISTORY_SIZE | PowerStateGraph | [private, static] |
edgeHistory | PowerStateGraph | [private] |
edgeListsAreEqual(const std::list< PSGraph::edge_descriptor > &a, const std::list< PSGraph::edge_descriptor > &b, const bool verbose=false) const | PowerStateGraph | [private] |
energyConsumption | PowerStateGraph | [private] |
findBestPath(const DisagTree &disagTree, const size_t deviceStart, const bool verbose=false) | PowerStateGraph | [private] |
findListOfPathsThroughDisagTree(const DisagTree &disagTree, const DisagTree::vertex_descriptor vertex, const LikelihoodAndVertex lav, std::list< LikelihoodAndVertex > path=std::list< LikelihoodAndVertex >(0)) | PowerStateGraph | [private] |
getEdgeHistoryForVertex(const DisagTree &disagTree, const DisagTree::vertex_descriptor &startVertex) const | PowerStateGraph | [private] |
getEnergyConsumption() const | PowerStateGraph | |
indexOfNextSpike(const std::list< Signature::Spike > &spikes, std::list< Signature::Spike >::iterator spike, const Signature &sig) const | PowerStateGraph | [private] |
initTraceToEnd(const AggregateData::FoundSpike &spike, const size_t deviceStart, const bool verbose=false) | PowerStateGraph | [private] |
listOfPaths | PowerStateGraph | [private] |
mostSimilarVertex(bool *success, const Statistic< Sample_t > &stat, const double ALPHA=0.0000005) const | PowerStateGraph | [private] |
offVertex | PowerStateGraph | [private] |
operator<<(std::ostream &o, const PowerStateGraph &psg) | PowerStateGraph | [friend] |
PowerStateGraph() | PowerStateGraph | |
powerStateGraph | PowerStateGraph | [private] |
printSpikeInfo(const std::list< Signature::Spike >::iterator spike, const size_t start, const size_t end, const Statistic< Sample_t > &before, const Statistic< Sample_t > &after, const Signature &sig) const | PowerStateGraph | [private] |
PSG_edge_index_map typedef | PowerStateGraph | [private] |
PSG_edge_iter typedef | PowerStateGraph | [private] |
PSG_out_edge_iter typedef | PowerStateGraph | [private] |
PSG_vertex_index_map typedef | PowerStateGraph | [private] |
PSG_vertex_iter typedef | PowerStateGraph | [private] |
PSGraph typedef | PowerStateGraph | [private] |
rejectSpike(const Statistic< Sample_t > &before, const Statistic< Sample_t > &after, const bool verbose=false) const | PowerStateGraph | [private] |
removeOverlapping(std::list< Fingerprint > *disagList, const bool verbose=false) | PowerStateGraph | [private] |
setDeviceName(const std::string &_deviceName) | PowerStateGraph | |
totalCount | PowerStateGraph | [private] |
traceToEnd(DisagTree *disagTree, const DisagTree::vertex_descriptor &vertex, const size_t prevTimestamp, const bool verbose=false) const | PowerStateGraph | [private] |
update(const Signature &sig, const bool verbose=false) | PowerStateGraph | |
updateEdges(const Signature &sig) | PowerStateGraph | [private] |
updateOrInsertEdge(const PSGraph::vertex_descriptor &beforeVertex, const PSGraph::vertex_descriptor &afterVertex, const size_t samplesSinceLastSpike, const double spikeDelta, const bool verbose=false) | PowerStateGraph | [private] |
updateOrInsertVertex(const Signature &sig, const Statistic< Sample_t > &postSpikePowerState, const Statistic< Sample_t > &betweenSpikesPowerState, const bool verbose=false) | PowerStateGraph | [private] |
writeGraphViz(std::ostream &out) | PowerStateGraph |