Project: engagement_recognition License: BSD Dependencies: engagement_msgs engagement_srvs roscpp Used by: None All Packages

engagement_recognition/src/recognition/statistics/window.cpp Go to the documentation of this file. /* * Software License Agreement (BSD License) * * Copyright (c) 2010, Worcester Polytechnic Institute * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * * * Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * * Redistributions in binary form must reproduce the above * copyright notice, this list of conditions and the following * disclaimer in the documentation and/or other materials provided * with the distribution. * * Neither the name of Worcester Polytechnic Institute. nor the names * of its contributors may be used to endorse or promote products * derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE * POSSIBILITY OF SUCH DAMAGE. */ /* * window.cpp * * Created on: Sep 8, 2010 * Author: Brett Ponsler (bponsler (at) wpi (dot) edu) */ #include "window.h" #include <stdio.h> #include "../recognizers/recognizer_factory.h" Window::Window() : events_(), earliest_(0) { } void Window::setWindowSize(double window_size) { this->window_size_ = window_size; } void Window::updateWindow() { this->window_size_ = this->window_size_; // Compute the start time of the window unsigned long window_start = CURRENT_TIME - (unsigned long)(this->window_size_ * 1000); // Traverse from the final event backward until we reach an even that // has a time below the window size for (this->earliest_ = this->events_.size(); this->earliest_ > 0 && this->events_.at(this->earliest_ - 1).getStart() >= window_start; this->earliest_--); } void Window::addEvent(ConnectionEvent event) { this->events_.push_back(event); this->updateWindow(); } unsigned long Window::getTimeBetween() { int index = this->events_.size(); // Ensure that two events exist, and return the time between the // most recent two events if (index >= 2) return (this->events_.at(index - 1).getStart() - this->events_.at(index - 2).getStart()); else return 0; } unsigned long Window::getRecentMeanDelay() { // Keep track of the total recent duration and number of events unsigned long total = 0; long events = 0; // Make sure the earliest index is valid if (this->earliest_ >= 0 && (unsigned)this->earliest_ < this->events_.size()) { // Traverse through the window of connection events for (unsigned i = this->earliest_; i < this->events_.size(); i++) { // As long as this is not a backchannel event add it into the total // NOTE: Backchannel events do not get added in the delay if (this->events_.at(i).getType() != RecognizerFactory::getBackchannelType()) { // Add the delay, and increment the number of events total += this->events_.at(i).getDelay(); events++; } } } // Return the mean recent delay return (events != 0 ? total / events : 0); } unsigned long Window::getRecentMaxDelay() { // Keep track of the max delay unsigned long max_delay = 0; // Make sure the earliest index is valid if (this->earliest_ >= 0 && (unsigned)this->earliest_ < this->events_.size()) { // Traverse through the window of connection events for (unsigned i = this->earliest_; i < this->events_.size(); i++) { // As long as this is not a backchannel event check the delay // NOTE: Backchannel events do not get added in the delay if (this->events_.at(i).getType() != RecognizerFactory::getBackchannelType()) { // Grab the delay from the event unsigned long delay = this->events_.at(i).getDelay(); // If this delay is a new max delay, store it if (max_delay < delay) max_delay = delay; } } } // Return the max delay return max_delay; } unsigned long Window::getRecentMeanDuration() { // Keep track of the total recent duration and number of events unsigned long total = 0; int events = 0; // Make sure the earliest index is valid if (this->earliest_ >= 0 && (unsigned)this->earliest_ < this->events_.size()) { // Traverse through the window of connection events for (unsigned i = this->earliest_; i < this->events_.size(); i++) { // Add the delay, and increment the number of events total += this->events_.at(i).getDuration(); events++; } } // Return the mean recent delay return (events != 0 ? total / events : 0); } unsigned long Window::getRecentMaxDuration() { // Keep track of the max delay unsigned long max_duration = 0; // Make sure the earliest index is valid if (this->earliest_ >= 0 && (unsigned)this->earliest_ < this->events_.size()) { // Traverse through the window of connection events for (unsigned i = this->earliest_; i < this->events_.size(); i++) { // Grab the duration from the event unsigned long duration = this->events_.at(i).getDuration(); // If this duration is a new max duration, store it if (max_duration < duration) max_duration = duration; } } // Return the max duration return max_duration; } unsigned long Window::getRecentMeanTBCE() { // Keep track of the total recent duration and number of events unsigned long total = 0; int events = 0; // Make sure the earliest index is valid if (this->earliest_ >= 0 && (unsigned)this->earliest_ < this->events_.size()) { // Traverse through the window of connection events for (unsigned i = this->earliest_ + 1; i < this->events_.size(); i++) { // Only add the event if it is successful if (this->events_.at(i).getSuccess()) { // Calculate the duration between the connection events unsigned long between = this->events_.at(i).getStart() - this->events_.at(i - 1).getStart(); // Keep track of the total duration, and number of events total += between; events++; } } } // Return the mean recent delay return (events != 0 ? total / events : 0); } unsigned long Window::getRecentMaxTBCE() { // Keep track of the maximum time between connection events unsigned long max_time = 0; // Make sure the earliest index is valid if (this->earliest_ >= 0 && (unsigned)this->earliest_ < this->events_.size()) { // Traverse through the window of connection events for (unsigned i = this->earliest_ + 1; i < this->events_.size(); i++) { // Only add the event if it is successful if (this->events_.at(i).getSuccess()) { // Calculate the duration between the connection events unsigned long between = this->events_.at(i).getStart() - this->events_.at(i - 1).getStart(); // If this is a new max, store it if (max_time < between) max_time = between; } } } // Return the max time between connection events return max_time; } int Window::getRecentFailureRate() { // Keep track of the total recent failed events int failed = 0; // Make sure the earliest index is valid if (this->earliest_ >= 0 && (unsigned)this->earliest_ < this->events_.size()) { // Traverse through the window of connection events for (unsigned i = this->earliest_; i < this->events_.size(); i++) { // If the connection event failed, increment the counter if (!this->events_.at(i).getSuccess()) failed++; } } // Calculate the number of failed connection events per window double rate_ms = (this->window_size_ != 0 ? (double)failed / (double)(this->window_size_ * 1000) : 0); // Return the number of failed events per minute of time return (rate_ms * 60000); }

---

engagement_recognition
Author(s): Brett Ponsler (bponsler (at) wpi (dot) edu)
autogenerated on Fri Sep 9 10:35:48 2011