The present disclosure relates generally to energy conservation and more specifically to determining an occupancy schedule based on resource usage data.
Households with programmable thermostats often do not program the thermostats with schedules and set points because the programming the thermostats is considered time consuming or complicated. Instead, some users prefer to manually manage schedules and set points. Manually managing the thermostat may lead to sub-optimal energy efficiency and customer satisfaction outcomes. Other households may program thermostats with schedules that do not accurately reflect occupancy periods or may fail to update the schedules programmed into thermostats to reflect changes in occupancy periods. These sub-optimal schedules may also lead to sub-optimal energy efficiency and customer satisfaction outcomes.
Energy efficiency is compromised if the household leaves the thermostat on when not at home or if the household turns the thermostat past the desired setting in an attempt to speed up the heating, ventilation, and air conditioning (HVAC) system. Customer satisfaction may be decreased through continually managing small temperature changes (e.g., during the heating season, decreasing the heating set point by five degrees every night before going to sleep and increasing the heating set point by five degrees every morning after waking up) and by having a sub-optimal temperature when moving to a new occupancy state (e.g., waking or returning home).
New smart devices may ameliorate these problems if provided with schedules, by efficiently using the HVAC system to control the household temperature according to the user's preferences.
A general architecture that implements the various features of the disclosure will now be described with reference to the drawings. The drawings and the associated descriptions are provided to illustrate embodiments of the disclosure and not to limit the scope of the disclosure. Throughout the drawings, reference numbers are reused to indicate correspondence between referenced elements.
A system and method according to an embodiment may determine an occupancy schedule at a location without the need for user input based on resource usage data (e.g., energy usage data) and provide the schedule to a thermostat or smart device, enabling the thermostat or smart device to increase energy efficiency and customer satisfaction by learning the household's schedule.
A detected occupancy schedule may be used for many purposes. For example, the detected occupancy schedule may be: (1) provided to a network connected thermostat configured to automatically set a set point schedule based on the detected occupancy schedule without the need for user input, thus making the configuration process of a thermostat fast and accurate from the moment a connected thermostat is installed; (2) periodically provided to a network connected thermostat so that, as a user's occupancy habits change, settings for the thermostat may be automatically adjusted based on an updated occupancy schedule without needing the user to adjust the thermostat manually; (3) used to determine energy and/or cost savings generated from adopting a more efficient schedule based on the detected occupancy schedule (e.g., based on modeled savings associated with adopting the more efficient schedule, or based on a comparison with savings from neighbors with similar schedules); (4) presented to a user as part of a questionnaire about his or her usage or occupancy habits; (5) used to determine different time-of-use tariff rates for a utility company to offer; (6) used in a connected home (e.g., a home having networked appliances, lighting, and/or HVAC systems) to optimize scheduled tasks (e.g., running a load of laundry based on the home's detected schedule); (7) determine targeted energy saving tips and promotions to present to utility customers based on the amount of time they are home (e.g., a residential customer may be presented with a tip or promotion to upgrade to energy efficient light bulbs based on a savings potential calculated from the number of evening hours the customer is awake at home); (8) used as inputs to other models such as those that predict customer satisfaction, when a residence is on vacation, or a set point identifier; (9) used by demand response providers to send more aggressive duty cycle programming to homes during periods of non-occupation; or (10) used to make more accurate demand response load shed calculations given the occupancy patterns of the participating residences.
Additionally, outside of the residential setting, a detected occupancy schedule may be used for a variety of purposes, including but not limited to: (1) an office building, which typically has regular hours of operation, may use schedule detection to identify excessive energy use outside of the expected hours of operation for the business (e.g., the parking lot lights may be flagged as being on past the expected time or certain components of the HVAC system may be flagged as being left on overnight when no occupants are in the building); (2) a courier service with knowledge of when a home is occupied may optimize their delivery schedules to reduce the amount of failed deliveries due to the lack of a person available to provide a signature; (3) residential fire alarm systems may suggest to first responders whether or not a building is occupied during an emergency event; or (4) residential burglary alarm systems may determine real versus false alarms given historical occupancy states.
The usage data over time may be represented as a load curve (i.e., a chart illustrating the variation in usage over time, such as that shown in
According to an alternative embodiment, the usage data represented as a load curve may also be supplemented or substituted with demographic, geographic, psychographic, and/or parcel data describing a given building and its occupants and/or data about a user's interactions with a thermostat. These data may be used by a system for determining an occupancy schedule at a location as direct inputs, regularization parameters, or for pre-processing. For example, a load curve may indicate significantly decreased usage at night, which may be used as described below to determine that indicate that the building is unoccupied or that building occupants are sleeping at night. If the load curve data is supplemented by parcel data indicating that a building is an office, this supplemental data may be used to determine that the building is unoccupied at night, rather than being occupied by sleeping occupants.
Next, in block 110 of
The detected occupancy schedule may be influenced depending on the aggregation and time period used. Aggregations may be preferable to raw usage data because of the high dimensionality of raw usage data over a long period of time and the susceptibility to outlier reads (e.g., a scenario in which the sample period includes a vacation period). Shorter aggregation periods may be preferable if occupancy schedules change over time as it may be possible to detect changes to occupancy schedules. However, using aggregation periods that are too short may not reflect a general pattern that would be captured by a longer aggregation period.
Usage data may be subdivided for aggregating by time-based status such as day of the week, weekday or weekend, month of the year, holiday or non-holiday, peak-usage event, etc. For example, in step 110, in the process of detecting a weekday occupancy schedule, usage data for the time period from 10:00 a.m. to 10:59 a.m. for each of the 20 previous weekdays may be added together and the sum divided by 20 to determine a mean usage amount for the 10 a.m. hour on weekdays. Likewise, in step 110, in the process of detecting a weekend occupancy schedule, usage data for the time period from 10:00 a.m. to 10:59 a.m. for each of the 10 previous weekend days may be added together and the sum divided by 10 to determine a mean usage amount for the 10 a.m. hour on weekends. Usage data may also be subdivided by combining these statuses (e.g., day of week by month to detect an occupancy schedule for a particular day of the week in a particular month). These subdivisions allow occupancy schedules that change based on the type of day to be detected.
Next, in block 120 of
The determined occupancy schedule may vary by type of day (e.g., day of the week, weekday or weekend, month of the year, holiday or non-holiday, peak-usage event, etc.) and reflect differing occupancy states and/or start times for the occupancy states. For example, if usage data for weekdays is aggregated in block 110, a weekday occupancy schedule may be determined in block 120. Likewise, if usage data for weekends is aggregated in block 110, a weekend occupancy schedule may be determined in block 120. The weekend occupancy schedule may only include the “wake up” and “go to sleep” occupancy states if the building is occupied all day on the weekend. Additionally, the start times for the “wake up” and “go to sleep” occupancy states may be different in the weekend occupancy schedule and in the weekday occupancy schedule.
In block 200, resource usage data indicating a quantity of electricity, gas, and/or water supplied by a utility to a location over a plurality of days are received. The resource usage data may include sub-daily usage data that includes resource usage data for a plurality of time periods in a day. For example, resource usage data received may be subdivided into a quantity of electricity, gas, and/or water used during each hour of the day for a plurality of days. Alternatively, the resource usage data may be subdivided into smaller or larger time periods. For example, the sub-daily usage data may include resource usage data for each 15 minute interval, each 30 minute interval, or each 2 hour interval for a period of days. According to some embodiments the sub-daily usage data may include data associated with different time periods or non-regular intervals (e.g., a 15 minute time period, a 17 minute time period, etc.).
In block 210, the electricity, gas, and/or water usage data is aggregated over a plurality of days for each of a plurality of time periods. For example, if the usage data is subdivided into by hour of the day, mean or median usage may be determined for each hour of the day for the plurality of days. The mean or median usage may be determined separately for each type of day (e.g., day of the week, weekday or weekend, month of the year, holiday or non-holiday, peak-usage event, etc.). For example, mean or median usage may be determined separately for weekdays and weekends. According to other embodiments, the resource usage data may be aggregated by calculating a value for each time period based on the resource usage data for the time period. For example, the value for each time period may be calculated based on the mean or median usage for the time period.
In block 220, the aggregated electricity, gas, and/or water usage data is used to determine an occupancy schedule at the location. Various methods may be used to determine the occupancy schedule using the aggregated usage data from block 210, including but not limited to the archetype-based methods, neighbor-dependent methods, path dependent methods, and path independent methods that are described in detail below. As discussed above, the determined occupancy schedule may include various occupancy states that capture the modes in which a building may be occupied as well as times of day when the various occupancy states start and/or end. Additionally, as discussed above, the determined occupancy schedule may vary by type of day (e.g., day of the week, weekday or weekend, month of the year, holiday or non-holiday, peak-usage event, etc.) and reflect differing occupancy states and/or start times for the occupancy states.
Next, in block 230, the determined occupancy schedule is used to determine a heating schedule, a cooling schedule, or a heating and cooling schedule for the location. For example, a heating schedule may be determined in which different set points are associated with each of the occupancy states. In the example heating schedule shown in Table 1 below, a thermostat heating set point of 68° F. is associated with the “Wake_Up” and “Return_Home” occupancy states, a thermostat heating set point of 63° F. is associated with the “Go_To_Sleep” occupancy state, and a thermostat heating set point of 58° F. is associated with the “Leave_Home” occupancy state.
The schedule may be configured such that the start time for each thermostat schedule period is the same as the start time for each occupancy state, as shown in Table 1 above. Alternatively, as shown in Table 2 below, the schedule may be configured such that set points associated with certain occupancy states are set on the thermostat prior to the start time for the associated occupancy states, in order to allow the heating or cooling system time to heat or cool to the set point prior to the start of the occupancy state. In other words, the thermostat schedule period start time may be set prior to the occupancy state start time at least for certain occupancy states, such as the “Wake_Up” state and the “Return_Home” state. The thermostat schedule period start time may be set a predetermined amount of time before the occupancy state start time (e.g., 15 minutes prior), or the schedule period start time may be set based upon a calculated amount of time required for the heating or cooling system to heat or cool to the set point.
The thermostat set point temperatures assigned to each schedule period corresponding to each occupancy state may be based on preferences specified by a utility customer, tenant, occupant, or other energy user. Alternatively, the thermostat set point temperatures may be energy efficient set points specified by the utility or a third party.
Next, in block 240, the determined heating schedule, determined cooling schedule, or determined heating and cooling schedule is provided to the thermostat at the location. The schedule may be transmitted over a network to the thermostat directly or may be transmitted to a client device such as a smartphone or mobile device that may display the schedule and/or provide for updating a thermostat with the determined schedule. Alternatively, the determined schedule may be provided through a webpage that may display the schedule and/or provide for updating a thermostat with the determined schedule.
According to another embodiment, in block 230, instead of determining a heating schedule, a cooling schedule, or a heating and cooling schedule for the location, other types of schedules may be determined, including a lighting schedule, an irrigation system schedule, a security system schedule, or any other type of schedule. Likewise, in block 240, the determined schedule may be provided to a controller that controls the associated system. For example, a lighting schedule may be provided to a lighting system controller.
Referring to
In block 310, the received additional usage data is aggregated for each of the plurality of time periods over the plurality of new days. As discussed above, mean or median usage for each of the plurality of time periods (e.g., each hour of the day) over the plurality of new days may be used.
In block 320, the aggregated additional usage data is used to determine an updated occupancy schedule at the location and/or an updated heating schedule, an updated cooling schedule, or an updated heating and cooling schedule for the location, as described in detail below. Various methods may be used to determine the updated occupancy schedule using the aggregated additional usage data from block 310, including but not limited to the archetype-based methods, neighbor-dependent methods, path dependent methods, and path independent methods that are described in detail below. The determined updated occupancy schedule may include various occupancy states that capture the modes in which the building may be occupied as well as times of day when the various occupancy states start and/or end.
The updated occupancy schedule and/or an updated heating schedule, an updated cooling schedule, or an updated heating and cooling schedule for the location may be transmitted to the thermostat directly or may be transmitted to a client device such as a smartphone or mobile device that may display the updated schedule and/or provide for updating a thermostat with the updated schedule. Alternatively, the updated schedule may be provided through a webpage that may display the updated schedule and/or provide for updating a thermostat with the updated schedule.
According to an embodiment, the usage data receiver 410 may receive usage data indicating a quantity of a resource supplied by a utility that is used at a location over a plurality of days, each of the plurality of days being subdivided into a plurality of predetermined time periods, and the usage data indicating the quantity of the resource supplied by the utility that is used during each of the predetermined time periods. The usage data aggregator 420 may aggregate the usage data for each of the plurality of predetermined time periods over the plurality of days. The occupancy schedule determiner 430 may use the aggregated usage data and the archetype-based methods, neighbor-dependent methods, path dependent methods, or path independent methods that are described in detail below to determine the occupancy schedule at the location. The usage data receiver 410, the usage data aggregator 420, and the occupancy schedule determiner 430 may be implemented as hardware modules or as software modules executed by one or more hardware processors.
According to some embodiments, the occupancy schedule determining system 400 may be implemented by one or more servers. In other embodiments, however, the occupancy schedule determining system 400 may be implemented by one or more client devices (e.g., a thermostat or a building interface device) or a combination of computing machines including a client device and a server.
A hierarchical set of occupancy states is one that includes status modes for occupying a building with a set of schedule states that goes with each status mode. For example, as illustrated in
An archetypical occupancy schedule is a schedule that follows a general pattern that energy users are likely to emulate. Archetypical occupancy schedules are used in the archetype-based approaches to determining occupancy schedules that are discussed in detail below. A first example of an archetypical occupancy schedule is a stay at home schedule in which the usage curve is shaped like a sine curve.
Archetypical occupancy schedules may be determined using publicly available resources of daily energy usage, actual customer usage profiles, and/or guesses at what load curves may look like. Publicly available resources may include sources such as the Energy Information Administration (EIA), Independent Service Operators (ISOs), and Regional Transmission Organizations (RTOs).
Additionally, archetypical occupancy schedules may be determined using actual customer usage profiles. Examples of this include clustering load curves and using the resulting centroids as archetypes. K-means clustering may be used to determine archetypes, though other clustering algorithms may also be used. With k-means clustering, a number of archetypes is selected and the k-means algorithm discovers the centroids (archetypes) that best partition the given load curves into the chosen number of groups. The centers or medians of those groups (i.e., mean or median usage at each time interval for each group) are chosen as archetypes.
Algorithms such as principal component analysis (PCA) or singular value decomposition (SVD) may be used to reduce the dimensionality used in clustering. These reduced dimensionality features are then fed into the clustering algorithm instead of the load curve values. Algorithms such as self-organizing maps (SOM) may be used that achieve clustering and dimensionality reduction together.
The occupancy schedule state change times associated with an archetype may be chosen via known actual schedules that customers input. For a given archetype, an aggregated schedule state change time may be selected to represent the archetype. For example, the “Wake_Up” state change may be the average or median time of that state change for all customers with known schedules assigned to that archetype (e.g., 7:00 a.m.).
Alternatively, schedule times may be imputed by assigning times to a given archetype using intuition and/or publicly available data. For example,
Alternatively, occupancy state may be determined using an “open-ended” approach in which state changes would not have labels such as “Wake_Up,” “Leave_Home,” “Return_Home,” or “Go_To_Sleep,” as in the examples above. Instead, state changes may be identified without regard to a label or occupancy model. The system may attempt to identify a certain number of state changes or find the optimal number to fit the given load curve. This approach would help to identify actual occupancy patterns that differ from a user's stated occupancy state or find patterns that do not easily fit into a given set of predefined hierarchical occupancy states.
Occupancy schedules may be determined using archetype and neighbor-dependent approaches. To detect a user's schedule with a clustering approach is dependent on having known or imputed schedules for other users, or archetype schedules with associated inputs. The steps of a clustering approach are outlined below.
Archetype-based approaches use archetypes to determine occupancy schedules for users. A user's predicted schedule is the schedule associated with the archetype having a load curve that most closely matches the user's load curve.
A first archetype-based approach is a clustering with archetypes approach. In this approach, a user's load curve (generated using the user's resource usage data) is compared to load curves associated with known archetypes. The predicted schedule for the user is the schedule associated with the archetype load curve that most closely resembles the user's actual load curve. Specifically, according to an embodiment, the following steps may be performed to determine a user's predicted schedule according to this archetype-based approach:
For a user u:
A second archetype-based approach is an archetype with a predictive model approach. In this approach, a predictive model or set of models is used to predict the archetype of a given user. The model is trained with predictor inputs of users with known schedules and an associated archetype. For example, the model may determine predictor inputs for an archetype load curve by performing PCA or SVD on load curves of users having known schedules corresponding to the archetype. Users with known schedules may be associated with an archetype manually or with an approach such as the clustering with archetypes approach discussed previously. Specifically, according to an embodiment, the following steps may be performed to determine a user's predicted schedule according to this archetype with a predictive model approach:
For a user u:
The archetypes with a predictive model approach may also be modified to work with nearest neighbor or similar predictive models. Specifically, according to an embodiment, the following steps may be performed to determine a user's predicted schedule according to an archetype-based approach using the k-nearest neighbor model:
For a user u:
Alternatively, neighbor-dependent approaches may be used to determine occupancy schedules for users. A first neighbor-dependent approach is a user specific representative schedule approach. This class of approaches is similar to the archetypes with a predictive model approach, but there will be more differentiation in the predicted schedule. The predicted schedule is derived from the known schedules of similar users by explicitly modeling each schedule state change time as opposed to an overall archetype. Specifically, according to an embodiment, the following steps may be performed to determine a user's predicted schedule according to the user specific representative schedule approach:
For a user u:
The user specific representative schedule approach may be modified to work with nearest-neighbor or similar predictive models. Specifically, according to an embodiment, the following steps may be performed to determine a user's predicted schedule according to the user specific representative schedule approach using the k-nearest neighbor model:
For a user u:
Instead of using the archetype and neighbor-dependent approaches described above, occupancy schedules may also be determined using hierarchical approaches. These approaches are used to predict schedules given an assumed hierarchical schedule. An assumed hierarchical schedule may be appropriate if a system is has specific operating modes or types of state changes.
A first hierarchical approach is a path dependent approach that first predicts top hierarchy layers and then predicts schedule state changes. A path dependent approach prunes the possible outcomes as each successive layer of the hierarchy is predicted. The examples assume a two layer hierarchy or mode and schedule as illustrated in
In this example we have one layer of schedule state changes (“Schedule” in
For example, the hierarchy illustrated in
In the example illustrated in
A first approach to predicting top hierarchy layers is an unsupervised clustering approach. Specifically, according to an embodiment, unsupervised clustering algorithms may be used to divide users with known schedules by the values of their predictor inputs as follows:
For a given layer with N nodes,
An alternative to the above approach is to first group by the known node before splitting into clusters. Steps (4) and (5) are swapped, thereby guaranteeing that there will not be any representation from other nodes within a given node's clusters. The downside to this approach is there may be similar clusters in different nodes. However, this is not any worse than the previous algorithm.
A second approach to predicting top hierarchy layers is a supervised prediction approach. This approach utilizes the known hierarchy statuses to model each node's likelihood. Specifically, according to an embodiment, the following steps may be performed to predict top hierarchy layers according to the supervised prediction approach:
For a given layer with N nodes,
A regularization term may be included in each step that penalizes nodes that are considered a priori to be less likely. Nodes may be considered a priori less likely based on survey data, publicly available data on energy usage patterns, or actual schedules set by users.
The penalty function penalizes less likely nodes, pushing the algorithm towards more likely nodes. An example penalty function may take the form of inverse proportion of users with a given node, but other functions may also be used.
1. For each node, n
penalty_n=1/(count(n)/N)
The supervised prediction approach may be modified to take advantage of k-nearest-neighbor type algorithms that do not require separate models for each node in a given layer. Specifically, according to an embodiment, the following steps may be performed:
In the path dependent hierarchical approach, after the top hierarchy layers are predicted, schedule state changes are predicted next. By predicating all the top-layer nodes, the field of possible schedule state changes is narrowed to those associated with the given branch of the tree hierarchy. For example, as illustrated in
A prediction model may be used to model each schedule state change within a given tree hierarchy. Specifically, according to an embodiment, the following steps may be performed to model each schedule state change:
For a user u:
The prediction model used to model each schedule state change within a given tree hierarchy as discussed above discards schedule state change times of users with different hierarchical nodes than those predicted for a given user. The algorithm is parsimonious and removes the influence of radically different types of schedules (e.g., schedules of night shift workers). The downside is that there may be useful information in other nodes that the algorithm cannot take advantage of.
An alternative approach is to use a prediction model with node likelihoods as predictors to model each schedule state change within a given hierarchy tree. The schedule state change time may be modeled as an explicit function of the likelihood of each node. Nodes with lower likelihoods will have a small effect on the predicted schedule state change time, while nodes with higher likelihoods will have a greater effect on the predicted schedule state change time. The state change prediction may be improved according to this approach if there are multiple nodes with relatively similar likelihoods, as all will be represented in the final state change prediction, not just the node with the highest rank order. Specifically, according to an embodiment, the following steps may be performed to model each schedule state change:
For a user u:
The above algorithm may be implemented with a simple model, such as a linear regression. Alternatively, a multilevel or hierarchical model may be used. Multilevel models allow parameters to vary for multiple levels, making use of the entire dataset (e.g., all users, regardless of each node's setting) in addition to more similar subsets (e.g., users with only a “Home_All_Day” setting).
Alternatively, a change point detection approach may be used to model each schedule state change within a given tree hierarchy. The change point detection approach may be used to detect schedule state changes in a time series. A change point detection approach is independent of other users' data and may be applied without any prior training of the model. However, trying different change point algorithms may help to find a particular algorithm and tuning that best predicts schedule state changes, since there are a variety of algorithms with different tuning parameters for each. Specifically, according to an embodiment, the following steps may be performed to model each schedule state change according to the change point detection approach:
For a user u:
A second hierarchical approach to determining occupancy schedules is to use a path independent method, as opposed to a path dependent method as described above. In contrast to the path dependent methods, path independent methods attempt to find the optimal number of schedule state changes, which are then fit to the closest matching hierarchy.
A first path independent method is an iterative change point approach. Specifically, according to an embodiment, the following steps may be performed to determine a user's predicted schedule according to the iterative change point approach:
For a user u:
A penalty function may be implemented to penalize schedules deemed a priori to be less likely. The penalty function may be used while determining the optimal number of states (step (3)) or when matching the predicted_s state changes to a hierarchy branch (step (5)). An example penalty function is the inverse proportion of users with chosen schedules. The actual penalty function may take any form and may be informed by actual schedule settings, public data from sources like the EIA or surveys.
A second path independent method is a change point with optimal number of states approach. In contrast to the iterative change point approach, the change point algorithm may internally determine the optimal number of change points. The resulting algorithm is simpler because it does not include the iterative procedure to determine the optimal number of states. Specifically, according to an embodiment, the following steps may be performed to determine a user's predicted schedule according to the change point with optimal number of states approach:
For a user u:
According to yet another embodiment, instead of using the archetype and neighbor-dependent approaches or hierarchical approaches described above, occupancy schedules may also be determined using open ended approaches. Open ended approaches have less structure than the previously discussed approaches. The path independent methods may be classified as open ended approaches if the last step from each (step (5) from the iterative change point approach and step (4) from the change point with optimal number of states approach) is removed. These methods find the optimal number of change points in a home and then try to fit them to a hierarchy.
Without the last step, relatively pure change points may be identified that may be used to determine if a user's stated schedule differs from the predicted schedule or to find additional archetypes or hierarchies. The open ended approaches may be incorporated into other the previously discussed methods, as with the path independent methods. For example, an open ended approach may be used to fit to an archetype instead of a hierarchy.
According to another embodiment, the approaches described above may be modified to use other input data in addition to or instead of the load cure data. For example, other known, calculated, or imputed property or geographic characteristics may be used, including the number of occupants at a location; owner-occupied, single- or multi-family residence status; presence of a pool; heat system type; etc. These characteristics may be used directly in the algorithms (e.g., as inputs in a regression model), or in pre-processing steps (e.g., to segment properties, to transform the load curve, or inputs to dimensionality reduction algorithms).
According to yet another embodiment, depending on the approach, pre-processing may be performed on the input data so that the input data is standardized to have a constant mean or standard deviation. This may be useful in group-level algorithms such as clustering, since magnitudes will be highly variable between buildings. Dimensionality may also be reduced in this step to extract the most representative features. Examples of dimensionality reduction include principle component analysis (PCA) and singular value decomposition (SVD). The outcomes of the pre-processing step are the “predictor inputs,” and may include any or all of the data discussed. Signal filtering may be performed using a Gaussian filter or Fourier transform.
Although some embodiments described above use resource usage data for one kind of resource (e.g., electricity), in other embodiments resource usage data for a number of different resources (e.g., a combination including electricity, network bandwidth, water, and/or gas) may also be used to determine an occupancy schedule for a building or location.
The usage data receiver 1041, the usage data aggregator 1043, the occupancy schedule determiner 1045, the controller 1047, and the memory 1049 operate to execute instructions, as known to one of skill in the art. The term “computer-readable storage medium” as used herein refers to any tangible medium, such as a disk or semiconductor memory, that participates in providing instructions to the usage data receiver 1041, the usage data aggregator 1043, the occupancy schedule determiner 1045, or the controller 1047 for execution.
According to an embodiment, one or both of server 11040 and server 21030 may implement the occupancy schedule determining system. For example, server 21030 may be located at a utility company, a third-party site, or any other location and be configured to receive information regarding resource usage by a plurality of utility customers over a plurality of days. Sever 21030 may communicate with or otherwise receive information from the database 1020 or another internal or external data source or database in the process of receiving information regarding resource usage by the plurality of utility customers. Server 21030 may aggregate the resource usage data for each of a plurality of time periods over the plurality of days. Server 21030 may usage the aggregated resource usage data to determine an occupancy schedule at a location and/or a heating schedule, cooling schedule, or heating and cooling schedule. The determined occupancy schedule and/or determined heating schedule, cooling schedule, or heating and cooling schedule may be provided to client devices 1050-1, 1050-2, 1050-3 and/or stored in the database 1020. The determined occupancy schedule and/or determined heating schedule, cooling schedule, or heating and cooling schedule may be communicated to sever 11040.
Server 11040 may receive data on a quantity of a resource used at a location over a plurality of days, aggregate usage data for each of a plurality of time periods over the plurality of days, and use the aggregated usage data to determine an occupancy schedule at the location and/or a heating schedule, cooling schedule, or heating and cooling schedule. Server 11040 may provide the determined occupancy schedule and/or determined heating schedule, cooling schedule, or heating and cooling schedule to client devices 1050-1, 1050-2, 1050-3, and/or store the determined schedule in a database. However, this is merely exemplary and the system may be implemented on a single server or on more than two servers. Further, the database 1020 may be optionally omitted. Various functions may be performed on separate servers.
The controller 1107 and the memory 1109 operate to execute instructions, as known to one of skill in the art. The controller 1107 may include at least one of a processor, a hardware module, or a circuit for performing its respective functions. The display 1105 may be configured to display the received information. Further, the display 1105 may be a touchscreen display and may act as an input device for interacting with a utility customer or other user. The client device 1100 may connect to the network 1010 using wireless protocols, such as 802.11 standards, Bluetooth®, or cellular protocols, or via physical transmission media, such as cables or fiber optics.
The client device 1100 may be embodied in many different forms such as a smartphone, a mobile device, a thermostat, a computer, a device having a graphical UI (GUI) from which a thermostat set point can be selected or adjusted, etc. The GUI may be accessed through an application installed on a utility customer's smartphone or through a browser displaying the utility customer's utility account. Therefore, a utility customer may be able to view information about the determined occupancy schedule and/or the determined heating schedule, cooling schedule, or heating and cooling schedule, modify the schedules, and/or remotely control their thermostat.
According to various embodiments, the system may also select content (e.g., energy saving tips, promotions, advertisements, information about utility services or programs, etc.) to provide to users based on their occupancy schedule and transmit the selected content to users. According to various embodiments, the system may use the occupancy schedule to calculate and manage demand response programs. For example, the system may determine that a user is not a good candidate to enroll in a demand response program because the user is not at home during peak events when a demand response event would be called. Alternatively, where the system is configured to control resource consuming devices at the user's home, the system may more aggressively reduce resource consumption during peak events if the user is not at home.
The foregoing detailed description has set forth various embodiments via the use of block diagrams, schematics, and examples. Insofar as such block diagrams, schematics, and examples contain one or more functions and/or operations, each function and/or operation within such block diagrams, flowcharts, or examples can be implemented, individually and/or collectively, by a wide range of hardware, software, or virtually any combination thereof, including software running on a general purpose computer or in the form of a specialized hardware.
While certain embodiments have been described, these embodiments have been presented by way of example only, and are not intended to limit the scope of the protection. Indeed, the novel methods and apparatuses described herein may be embodied in a variety of other forms. Furthermore, various omissions, substitutions and changes in the form of the methods and systems described herein may be made without departing from the spirit of the protection. The accompanying claims and their equivalents are intended to cover such forms or modifications as would fall within the scope and spirit of the protection.
This application claims priority to and the benefit of U.S. Provisional Patent Application No. 61/834,166, filed on Jun. 12, 2013, the disclosure of which is incorporated by reference herein in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
4334275 | Levine | Jun 1982 | A |
4843575 | Crane | Jun 1989 | A |
5513519 | Cauger et al. | May 1996 | A |
5566084 | Cmar | Oct 1996 | A |
5717609 | Packa et al. | Feb 1998 | A |
5855011 | Tatsuoka | Dec 1998 | A |
5873251 | Iino | Feb 1999 | A |
5930773 | Crooks et al. | Jul 1999 | A |
5930803 | Becker et al. | Jul 1999 | A |
5948303 | Larson | Sep 1999 | A |
6035285 | Schlect et al. | Mar 2000 | A |
6088688 | Crooks et al. | Jul 2000 | A |
6295504 | Ye et al. | Sep 2001 | B1 |
6327605 | Arakawa et al. | Dec 2001 | B2 |
D462077 | Greminger | Aug 2002 | S |
6606104 | Kondo et al. | Aug 2003 | B1 |
6701298 | Jutsen | Mar 2004 | B1 |
6732055 | Bagepalli et al. | May 2004 | B2 |
6778945 | Chassin et al. | Aug 2004 | B2 |
6785620 | Kishlock et al. | Aug 2004 | B2 |
6972660 | Montgomery, Jr. et al. | Dec 2005 | B1 |
7020508 | Stivoric et al. | Mar 2006 | B2 |
7073073 | Nonaka et al. | Jul 2006 | B1 |
7073075 | Freyman et al. | Jul 2006 | B2 |
7136710 | Hoffberg et al. | Nov 2006 | B1 |
7142949 | Brewster et al. | Nov 2006 | B2 |
7149727 | Nicholls et al. | Dec 2006 | B1 |
7200468 | Ruhnke et al. | Apr 2007 | B2 |
7243044 | McCalla | Jul 2007 | B2 |
7333880 | Brewster et al. | Feb 2008 | B2 |
7356548 | Culp et al. | Apr 2008 | B1 |
7444251 | Nikovski et al. | Oct 2008 | B2 |
7460502 | Arima et al. | Dec 2008 | B2 |
7460899 | Almen | Dec 2008 | B2 |
7552030 | Guralnik et al. | Jun 2009 | B2 |
7561977 | Horst et al. | Jul 2009 | B2 |
D605652 | Plaisted et al. | Dec 2009 | S |
7778734 | Oswald | Aug 2010 | B2 |
7878890 | Toyohara et al. | Feb 2011 | B2 |
7991513 | Pitt | Aug 2011 | B2 |
8065098 | Gautam | Nov 2011 | B2 |
8166047 | Cohen et al. | Apr 2012 | B1 |
D660867 | Marchetti | May 2012 | S |
8180591 | Yuen et al. | May 2012 | B2 |
D665411 | Rai et al. | Aug 2012 | S |
8239178 | Gray et al. | Aug 2012 | B2 |
D667841 | Rai et al. | Sep 2012 | S |
8260468 | Ippolito et al. | Sep 2012 | B2 |
8275635 | Stivoric et al. | Sep 2012 | B2 |
8280536 | Fadell et al. | Oct 2012 | B1 |
D671550 | Chen et al. | Nov 2012 | S |
8348840 | Heit et al. | Jan 2013 | B2 |
8375118 | Hao et al. | Feb 2013 | B2 |
8417061 | Kennedy et al. | Apr 2013 | B2 |
8428785 | Boucher et al. | Apr 2013 | B2 |
8429630 | Nickolov et al. | Apr 2013 | B2 |
8478447 | Fadell et al. | Jul 2013 | B2 |
8489245 | Carrel et al. | Jul 2013 | B2 |
D687445 | Fuhrmann | Aug 2013 | S |
D694252 | Helm | Nov 2013 | S |
8583288 | Rossi et al. | Nov 2013 | B1 |
D697526 | Bruck et al. | Jan 2014 | S |
8630741 | Matsuoka et al. | Jan 2014 | B1 |
8660813 | Curtis et al. | Feb 2014 | B2 |
D703690 | MacCubbin et al. | Apr 2014 | S |
8690751 | Auphan | Apr 2014 | B2 |
D707245 | Bruck et al. | Jun 2014 | S |
8751432 | Berg-Sonne et al. | Jun 2014 | B2 |
D710871 | McCormack et al. | Aug 2014 | S |
8805000 | Derby et al. | Aug 2014 | B2 |
8818758 | Singh et al. | Aug 2014 | B1 |
D714335 | Cojuangco et al. | Sep 2014 | S |
8868248 | Park | Oct 2014 | B2 |
D717328 | Lin | Nov 2014 | S |
D720767 | Miller et al. | Jan 2015 | S |
8954849 | Doi et al. | Feb 2015 | B2 |
D725133 | Smirin et al. | Mar 2015 | S |
D725664 | Nies et al. | Mar 2015 | S |
D729268 | Nies et al. | May 2015 | S |
D730386 | Ryan et al. | May 2015 | S |
9031703 | Nakamura et al. | May 2015 | B2 |
RE45574 | Harter | Jun 2015 | E |
D731538 | Lee | Jun 2015 | S |
D732049 | Amin | Jun 2015 | S |
D732062 | Kwon | Jun 2015 | S |
D740847 | Yampolskiy et al. | Oct 2015 | S |
RE46236 | Harter | Dec 2016 | E |
20010047290 | Petras et al. | Nov 2001 | A1 |
20020065581 | Fasca | May 2002 | A1 |
20020178047 | Or et al. | Nov 2002 | A1 |
20020198629 | Ellis | Dec 2002 | A1 |
20030011486 | Ying | Jan 2003 | A1 |
20030018517 | Dull et al. | Jan 2003 | A1 |
20030023467 | Moldovan | Jan 2003 | A1 |
20030120370 | Kitayama | Jun 2003 | A1 |
20030216971 | Sick et al. | Nov 2003 | A1 |
20040024717 | Sneeringer | Feb 2004 | A1 |
20040111410 | Burgoon et al. | Jun 2004 | A1 |
20040140908 | Gladwin et al. | Jul 2004 | A1 |
20050257540 | Choi et al. | Nov 2005 | A1 |
20060089851 | Silby et al. | Apr 2006 | A1 |
20060093222 | Saffer et al. | May 2006 | A1 |
20060103549 | Hunt et al. | May 2006 | A1 |
20060195438 | Galuten | Aug 2006 | A1 |
20060246968 | Dyke-Wells | Nov 2006 | A1 |
20070061735 | Hoffberg et al. | Mar 2007 | A1 |
20070185835 | Ursitti et al. | Aug 2007 | A1 |
20070198459 | Boone et al. | Aug 2007 | A1 |
20070203860 | Golden et al. | Aug 2007 | A1 |
20070213992 | Anderson et al. | Sep 2007 | A1 |
20070255457 | Whitcomb et al. | Nov 2007 | A1 |
20070260405 | McConnell et al. | Nov 2007 | A1 |
20080027885 | van Putten et al. | Jan 2008 | A1 |
20080033587 | Kurita et al. | Feb 2008 | A1 |
20080167535 | Stivoric et al. | Jul 2008 | A1 |
20080189632 | Tien et al. | Aug 2008 | A1 |
20080195561 | Herzig | Aug 2008 | A1 |
20080222561 | Helfman et al. | Sep 2008 | A1 |
20080244429 | Stading | Oct 2008 | A1 |
20080281473 | Pitt | Nov 2008 | A1 |
20080281763 | Yliniemi | Nov 2008 | A1 |
20080304112 | Matsuno | Dec 2008 | A1 |
20080306985 | Murray et al. | Dec 2008 | A1 |
20090106202 | Mizrahi | Apr 2009 | A1 |
20090106674 | Bray et al. | Apr 2009 | A1 |
20090187286 | Magalhaes Medeiros Neto | Jul 2009 | A1 |
20090204267 | Sustaeta et al. | Aug 2009 | A1 |
20090217175 | Bechtel et al. | Aug 2009 | A1 |
20090217179 | Mons et al. | Aug 2009 | A1 |
20090326726 | Ippolito et al. | Dec 2009 | A1 |
20100019051 | Rosen | Jan 2010 | A1 |
20100025483 | Hoeynck et al. | Feb 2010 | A1 |
20100076835 | Silverman | Mar 2010 | A1 |
20100082174 | Weaver | Apr 2010 | A1 |
20100099954 | Dickinson et al. | Apr 2010 | A1 |
20100106575 | Bixby et al. | Apr 2010 | A1 |
20100138363 | Batterberry et al. | Jun 2010 | A1 |
20100156665 | Krzyzanowski et al. | Jun 2010 | A1 |
20100179704 | Ozog | Jul 2010 | A1 |
20100180223 | Speier | Jul 2010 | A1 |
20100198713 | Forbes, Jr. et al. | Aug 2010 | A1 |
20100217452 | McCord et al. | Aug 2010 | A1 |
20100217549 | Galvin et al. | Aug 2010 | A1 |
20100217550 | Crabtree et al. | Aug 2010 | A1 |
20100217642 | Crubtree et al. | Aug 2010 | A1 |
20100217651 | Crabtree et al. | Aug 2010 | A1 |
20100232671 | Dam et al. | Sep 2010 | A1 |
20100241648 | Ito et al. | Sep 2010 | A1 |
20100283606 | Tsypin | Nov 2010 | A1 |
20100286937 | Hedley et al. | Nov 2010 | A1 |
20100289643 | Trundle et al. | Nov 2010 | A1 |
20100324962 | Nesler et al. | Dec 2010 | A1 |
20100332373 | Crabtree et al. | Dec 2010 | A1 |
20110015798 | Golden | Jan 2011 | A1 |
20110022429 | Yates et al. | Jan 2011 | A1 |
20110023045 | Yates et al. | Jan 2011 | A1 |
20110040666 | Crabtree et al. | Feb 2011 | A1 |
20110061014 | Frader-Thompson et al. | Mar 2011 | A1 |
20110063126 | Kennedy et al. | Mar 2011 | A1 |
20110106316 | Drew et al. | May 2011 | A1 |
20110106328 | Zhou et al. | May 2011 | A1 |
20110106471 | Curtis et al. | May 2011 | A1 |
20110153102 | Tyagi et al. | Jun 2011 | A1 |
20110178842 | Rane et al. | Jul 2011 | A1 |
20110178937 | Bowman | Jul 2011 | A1 |
20110205245 | Kennedy et al. | Aug 2011 | A1 |
20110231320 | Irving | Sep 2011 | A1 |
20110251730 | Pitt | Oct 2011 | A1 |
20110251807 | Rada et al. | Oct 2011 | A1 |
20110282505 | Tomita et al. | Nov 2011 | A1 |
20110313964 | Sanchey Loureda et al. | Dec 2011 | A1 |
20120036250 | Vaswani et al. | Feb 2012 | A1 |
20120053740 | Venkatakrishnan et al. | Mar 2012 | A1 |
20120066168 | Fadell et al. | Mar 2012 | A1 |
20120078417 | Connell, II et al. | Mar 2012 | A1 |
20120084063 | Drees et al. | Apr 2012 | A1 |
20120165993 | Whitehouse | Jun 2012 | A1 |
20120179692 | Hsiao et al. | Jul 2012 | A1 |
20120215369 | Desai et al. | Aug 2012 | A1 |
20120216123 | Shklovskii et al. | Aug 2012 | A1 |
20120259678 | Overturf et al. | Oct 2012 | A1 |
20120290230 | Berges Gonzalez et al. | Nov 2012 | A1 |
20120310708 | Curtis et al. | Dec 2012 | A1 |
20130030600 | Shetty | Jan 2013 | A1 |
20130055132 | Foslien | Feb 2013 | A1 |
20130060531 | Burke et al. | Mar 2013 | A1 |
20130060720 | Burke | Mar 2013 | A1 |
20130073094 | Knapton | Mar 2013 | A1 |
20130097177 | Fan et al. | Apr 2013 | A1 |
20130097481 | Kotler et al. | Apr 2013 | A1 |
20130138651 | Lu | May 2013 | A1 |
20130173064 | Fadell et al. | Jul 2013 | A1 |
20130173191 | McDonald | Jul 2013 | A1 |
20130253709 | Renggli et al. | Sep 2013 | A1 |
20130261799 | Kuhlmann et al. | Oct 2013 | A1 |
20130262040 | Buckley | Oct 2013 | A1 |
20140006314 | Yu et al. | Jan 2014 | A1 |
20140019319 | Derby et al. | Jan 2014 | A1 |
20140074300 | Shilts et al. | Mar 2014 | A1 |
20140107850 | Curtis | Apr 2014 | A1 |
20140148706 | Van Treeck et al. | May 2014 | A1 |
20140163746 | Drew et al. | Jun 2014 | A1 |
20140172503 | Hammerstrom | Jun 2014 | A1 |
20140207292 | Ramagem et al. | Jul 2014 | A1 |
20140277765 | Karimi | Sep 2014 | A1 |
20140337107 | Foster | Nov 2014 | A1 |
20150227522 | O'Donnell et al. | Aug 2015 | A1 |
20150227846 | Mercer et al. | Aug 2015 | A1 |
20150254246 | Sheth et al. | Sep 2015 | A1 |
20150256401 | Zinger | Sep 2015 | A1 |
20150267935 | Devenish et al. | Sep 2015 | A1 |
20150269664 | Davidson | Sep 2015 | A1 |
20150300831 | Sernicola | Oct 2015 | A1 |
20150310019 | Royer et al. | Oct 2015 | A1 |
20150310463 | Turfboer et al. | Oct 2015 | A1 |
20150310465 | Chan et al. | Oct 2015 | A1 |
20150316907 | Elbsat | Nov 2015 | A1 |
20150319119 | Ryu et al. | Nov 2015 | A1 |
20150324819 | Lin et al. | Nov 2015 | A1 |
20150326679 | Lin et al. | Nov 2015 | A1 |
20160042049 | Shilts | Feb 2016 | A1 |
Number | Date | Country |
---|---|---|
2779754 | May 2011 | CA |
2832211 | Nov 2012 | CA |
3703387 | Aug 1987 | DE |
102011077522 | Dec 2012 | DE |
0003010 | Jul 1979 | EP |
2705440 | Mar 2014 | EP |
2496991 | Sep 2014 | EP |
1525656 | Sep 1978 | GB |
2238405 | May 1991 | GB |
2000-270379 | Sep 2000 | JP |
2004-233118 | Aug 2004 | JP |
2006-119931 | May 2006 | JP |
2007-133468 | May 2007 | JP |
2011-027305 | Feb 2011 | JP |
2012-080679 | Apr 2012 | JP |
2012-080681 | Apr 2012 | JP |
2013-020307 | Jan 2013 | JP |
WO 03102865 | Dec 2003 | WO |
WO 03104941 | Dec 2003 | WO |
WO 2008101248 | Aug 2008 | WO |
WO 2009085610 | Jul 2009 | WO |
WO 2011057072 | May 2011 | WO |
WO 2012112358 | Aug 2012 | WO |
WO 2012154566 | Nov 2012 | WO |
WO 2013023691 | Feb 2013 | WO |
WO 2014004148 | Jan 2014 | WO |
WO 2014182656 | Nov 2014 | WO |
Entry |
---|
International Search Report and Written Opinion for PCT Application No. PCT/US2015/038692, dated Sep. 24, 2015, 13 pages. |
International Preliminary Report on Patentability for PCT Application No. PCT/US2010/055621, dated May 15, 2012, 8 pages. |
International Search Report and Written Opinion for PCT Application No. PCT/US2010/055621, dated Dec. 23, 2010, 9 pages. |
International Search Report and Written Opinion for PCT Application No. PCT/US2012/036539, dated Jul. 6, 2012, 8 pages. |
International Preliminary Report on Patentability for PCT Application No. PCT/US2012/036539, dated Nov. 21, 2013, 7 pages. |
International Search Report and Written Opinion for PCT Application No. PCT/US2013/046126, dated Aug. 22, 2013, 9 pages. |
International Preliminary Report on Patentability for PCT Application No. PCT/US2013/046126, dated Jan. 8, 2015, 8 pages. |
International Search Report for PCT Application No. PCT/US2014/036901, dated Aug. 28, 2014, 3 pages. |
Patent Examination Report No. 1 for Australian Patent Application No. 2010315015, dated Dec. 17, 2013, 3 pages. |
Extended European Search Report for European Patent Application No. 12782569.3, dated Nov. 27, 2014, 7 pages. |
Aragon, Liz, “Black and White Emoticons,” posted at Sweet Clip Art, posting date Apr. 29, 2012. © 2011 2015 Elizabeth J. Aragon, available at http://sweetclipart.com/blackandwhiteemoticons838>. |
Author Unknown, “An Inconvenient Truth,” Jan. 9, 2008, 2 pages, available at http://web.archive.org/web/2008019005509/http://www.climatecrisis.net/takeaction/carbonca/. |
Author Unknown, “Calculate Your Impact,” Jul. 28, 2008, 4 pages, available at http://web.archive.org/web/20080728161614/http://green.yahoo.com/calculator/. |
Author Unknown, “Carbon Footprint Calculator: What's My Carbon Footprint?” The Nature Conservancy, Jul. 8, 2008, 8 pages, available at http://web.archive.org/web/20080708193253/http://www.nature.org/initiatives/climatechange/calculator/2008. |
Author Unknown, “CoolClimate Calculator,” May 19, 2008, 15 pages, available at http://web.archive.orgi/web/20080519220643/bie.berkeley.edu/coolcale/calculations.html. |
Author Unknown, “Lifecycle Climate Footprint Calculator,” Berkeley Institute of the Environment, Nov. 23, 2007, 6 pages, available at http://web.archive.org/web/20071123115832/http://bie.berkeley.edu/calculator. |
Author Unknown, “More than just a thermostat.,” http://www.ecobee.com/, 4 pages, Jul. 16, 2013. |
Author Unknown, “Popups Climate Change: Carbon Calculator—Greenhouse Gas and Carbon Dioxide Calculator Wed Pages,” The Nature Conservancy, 5 pages, Feb. 29, 2008, available at http://web.archive.org/web/20080229072420/www.nature.org/popups/misc/art20625.html. |
Bailey, Timothy, et al., “Fitting a Mixture Model by Expectation Maximization to Discover Motifs in Biopolymers,” UCSD Technical Report CS94-351, Proceedings of the Second International Conf. on Intelligent Systems for Molecular Biology, 1994, 33 pages. |
Blaine, Joel, “Seven Cities and a Utility Company Team Up to Deliver Energy Savings,” posted at Dept. of Energy, posting date Aug. 1, 2011, available at http://energy.gov/articles/sevencitiesandutilitycompanyteamdeliverresidentialenergysavings>. |
Chen, Hanfeng, et al., “Testing for a Finite Mixture Model With Two Components,” Journal of the Royal Statistical Society, Series B, vol. 66, No. 1, 26 pages, 2004. |
De Prensa, Boletine, “TXU Energy Budget Alerts Give Consumers Control of Electricity Costs,” TXU Energy, http://www.txu.com/es/about/press, 2 pages, May 23, 2012. |
Deb, Partha, “Finite Mixture Models,” Hunter College and the Graduate Center, CUNY NBER, FMM Slides, 42 pages, Jul. 2008. |
D'Urso, M., et al., “A Simple Strategy for Life Signs Detection Via an X-Band Experimental Set-Up,” Progress in Electromagnectics Research C, vol. 9, pp. 119-129 (2009). |
Eckmann, J.P., et al., “Ergodic theory of chaos and strange attractors,” Reviews of Modern Physics, vol. 57, No. 3, Part I, pp. 617-656, Jul. 1985. |
Espinoza, Marcelo, et al., “Short-Term Load Forecasting, Profile Identification, and Customer Segmentation: A Methodology Based on Periodic Time Series,” IEEE Transactions on Power Systems, vol. 20, No. 3, pp. 1622-1630, Aug. 2005. |
Fels, Margaret F., “PRISM: An Introduction,” Elsevier Sequoia, Energy and Buildings, vol. 9, pp. 5-18, 1986. |
Fels, Margaret F., et al., Seasonality of Non-heating Consumption and Its effect on PRISM Results, Elsevier Sequoia, Energy and Buildings, vol. 9, pp. 139-148, 1986. |
Figueiredo, Vera, et al., “An Electric Energy Consumer Characterization Framework Based on Data Mining Techniques,” IEEE Transactions on Power Systems, vol. 20, No. 2, pp. 596-602, May 2005. |
Fitbit® Official Site, “Flex, One & Zip Wireless Activity & Sleep Trackers,” http://www.fitbit.com/, 4 pages, Jul. 15, 2013. |
Freepik, Surprised emoticon square face with open eyes and mouth, posted at Flat Icon, posting date not given. © 2013-2015 Graphic Resources SL, available at http://www.flaticon.com/freeicon/surprisedemoticonsquarefacewithopeneyesandmouth_42835>. |
Friedman, Jerome, et al., “Regularization Paths for Generalized Linear Models via Coordinate Descent,” Journal of Statistical Sotfware, vol. 33, Iss. 1, pp. 1-22, Jan. 2010. |
Gelber, Bob, “This Is Not A Bill,” posted at Not A Mystery, posting date Apr. 18, 2015, available at http://notamystery.com/2015/04/18/not_worth_the_papeUts_printed_on/>. |
Goldberg, Miriam L., et al., “Refraction of PRISM Results into Components of Saved Energy,” Elsevier Sequoia, Energy and Buildings, vol. 9, pp. 169-180, 1986. |
Jansen, R.C., “Maximum Likelihood in a Generalized Linear Finite Mixture Model by Using the EM Algorithm,” Biometrics, vol. 49, pp. 227-231, Mar. 1993. |
Jawbone, “Know yourself. Live better.” https://jawbone.com/up/, 7 pages, Jul. 15, 2013. |
Karsten, “Green nudge: The classic social comparison experiment by Opower,” posted at iNudgeyou, posting date Nov. 28, 2012, available at http://inudgeyou.com/greennudgetheclassicsocialcomparisonexperimenbyopower/>. |
Laskey, Alex, et al., “Opower,” posted at ACM, posting date Jun. 2011, Copyright © 2015 by the ACM, available at http://xrds.acm.org/article.cfm?aid=1961687>. |
Leisch, Friedrich, “FlexMix: A General Framework for Finite Mixture Models and Latent Class Regression in R,” Journal of Statistical Software, http://www.istatsoft.org, vol. 11 (8), pp. 1-18, Oct. 2004. |
Liang, Jian, et al. “Load Signature Study—Part II: Disaggregation Framework, Simulation, and Applications,” IEEE Transactions on Power Delivery, vol. 25, No. 2, pp. 561-569, Apr. 2010. |
Liang, Jian, et al., “Load Signature Study—Part I-II: Basic Concept, Structure, and Methodology,” IEEE Transactions On Power Delivery, vol. 25, No. 2, pp. 551-569, Apr. 2010. |
Marshall, Jonathan, “PG&E Home Energy Reports Stimulate Big Customer Savings,” posted at PG&E Currents, posting date May 14, 2014, © 2014 Pacific Gas and Electric Company, available at http://www.pgecurrents.com/2014/05/14/pgehomeenergyreportsstimulatebigcustomersavings/>. |
Mint.com, “Budgets you'll actually stick to,” Budgeting—Calculate and Categorize your spending, https://www.mint.com/how-it-works/budgeting/, 2 pages, Jul. 12, 2013. |
Mint.com, “We're always on alert.” Alerts for bills, fees & going over budget, https://www.mint.com/how-it-works/alerts/, 2 pages, Jul. 12, 2013. |
Morabito, Kerri, “High User Campaign,” posted at Kerri Morabito, posting date not given, © Kerri Morabito, 2015, available at <URL: http://www.kerrimorabito.com/high-user-campaign.html>. |
Mori, Hiroyuki, “State-of-the-Art Overview on Data Mining in Power Systems,” IEEE, pp. 33-37, 2006. |
Muthen, Bengt, et al., Finite Mixture Modeling with Mixture Outcomes Using the EM Algorithm, Biometrics, vol. 55, pp. 463-469, Jun. 1999. |
Nest, “The Learning Thermostat,” http://www.nest.com/, 2 pages, Jul. 15, 2013. |
Nike.com, “Nike + FuelBand. Tracks your all-day activity and helps you do more . . . ,” http://www.nike.com/us/en_us/c/nikeplus-f..uelband, 7 pages, Jul. 15, 2013. |
Rocheleau, Jake, “38 Amazingly Well-Designed Emoji Iconsets,” posted at SpyreStudios, posting date Mar. 25, 2015, SpyreStudios © 2015, available at http://spyrestudios.com/38welldesignedemojiiconsets/>. |
Rose, O. “Estimation of the Hurst Parameter of Long-Range Dependent Time Series,” University of Wuirzburg, Institute of Computer Science, Research Report Series, Report No. 137, 15 pages, Feb. 1996. |
Sawka, Michael N., et al., “Human Adaptations to Heat and Cold Stress,” RTOMP-076, 16 pages, Oct. 2001. |
Stephen, Bruce, et al. “Domestic Load Characterization Through Smart Meter Advance Stratification,” IEEE Transactions On Smart Grid, Power Engineering Letter, vol. 3, No. 3, pp. 1571-1572, Sep. 2012. |
Stoop, R., et al., “Calculation of Lyapunov exponents avoiding spurious elements,” Physica D 50, pp. 89-94, May 1991. |
Wang, Xiaozhe, et al. “Rule induction for forecasting method selection: meta-learning the characteristics of univariate time series,” Faculty of information Technology, Department of Econometrics and Business Statistics, Monash University, pp. 1-34. |
Wang, Xiaozhe, et al., “Characteristic-Based Clustering for Time Series Data,” Data Mining and Knowledge Discovery, Springer Science & Business Media, LLC, vol. 13, pp. 335-364 (2006). |
Wehrens, Ron, et al. “Self- and Super-organizing Maps in R: The kohonen Package,” Journal of Statistical Software, vol. 21, Iss. 5, pp. 1-19, Oct. 2007. |
Wikipedia, “Akaike information criterion,” 6 pages, Aug. 17, 2012. |
Wikipedia, “Mixture model,” 10 pages, Oct. 7, 2012. |
Number | Date | Country | |
---|---|---|---|
61834166 | Jun 2013 | US |