Abstract: The present invention helps generate connected communities of students and educators through access to an increased pool of granular learning resources that benefit from standardization of formats for creating and utilizing individual discussions on individual topics. The present invention also circumvents the complexity of existing repository systems by creating a standard platform format. Because this format is de facto implemented for any educator using the platform, standardized question types (e.g., discussion types or topic types) become functionally interchangeable notwithstanding any particular individuals utilizing the invention. The interchangeability of individual topics allows for creation of a global “topic library,” which may be made available to any educator using the system.

Abstract: Embodiments of the present invention facilitate the solicitation of user input while allowing for dynamic changes to that input while concurrently ranking the same. Ranking occurs in real-time and allows for a user to alter their contribution or vote until the close of a contribution period allowing real-time influences to be taken into account. Contributions may be provided in response to or as a part of a template driven nomination process. Solicitations of input may occur in the context of a pre-defined slate of options for voting, nominating certain options for a subsequent or concurrent voting process, or choosing/suggest more than one option such as the best of a slate of options or the individual ranking of a slate of options. Embodiments of the present invention capture all user nominations or suggestions while simultaneously providing the real-time ranking and dynamic re-ranking of those nominations or suggestions.

Abstract: A method of bandwidth allocation for delivery of stored digital content from at least one server device to at least one client device by way of a network. The method includes the steps of: describing a control variable which represents a target flow rate of content from the server device to each client device; determining time-varying constraints on the target flow rate of the content; determining a cost function of the control variables for all clients, wherein the cost function represents an aggregate flow rate and is a sum of all flow rates for all clients; and prescribing bandwidth to all clients based upon a value of the control variables that maximize the cost function comprising performing periodic computations to update the value of the control variable such that the bandwidth can be continuously allocated to each client.

Abstract: A method for bandwidth allocation for delivery of multimedia data from at least one server to one or more clients over a network. The method includes the steps of: determining a maximum flow rate and a minimum flow rate for each client; determining a flow rate range for each client as given by the difference between the maximum flow rate and the minimum flow rate; sorting the one or more clients according to the flow rate range; initializing a current flow rate for each client as the minimum flow rate and summing the flow rate into total server flow rate; establishing remaining server bandwidth; and allocating the remaining server bandwidth to clients, based upon the sorted client's flow rate ranges.

Abstract: A method of bandwidth allocation for delivery of stored digital content from at least one server device to at least one client device by way of a network is disclosed. The method begins by prescribing a control variable which represents a target flow rate from the server device to each client device. Next, time-varying constraints on the flow rate of the content are determined. A cost function of the control variable for each client is determined. The cost function corresponds to a maximized value of the control variable. Finally, bandwidth is prescribed to each client based upon the value of the control variable maximized by the cost function. In this respect, the method achieves optimal allocation of bandwidth between the server and the respective clients.