Audience binning system and method for webcasting and on-line presentations

Description

FIELD

The disclosure relates generally to virtual events and live webcasting, especially when there is a need for live communications among audience members.

BACKGROUND

Group conversations are a difficult social exercise in itself. This difficulty is magnified by several orders when conversation goes online, size of group increases, groups are malformed, contextual information is insufficient (or incorrect) and return on investment for participants' time is low.

Group chatting is among the most popular form of communication for both personal and professional use. Needless to say there exist several dozen solutions that enables group chatting. However, the number of solutions and their effectiveness decrease with increasing size of group, especially in a professional setting where return on investment of time is measured. For example, commercial solutions like Campfire and HipChat caters to teams where context is well-defined and size is very small, namely team members. Freemium solutions like Yahoo, Facebook or Skype Chat are built for personal use with friends and family. Thus, both these existing systems does not scale well or handle larger groups, such as the groups in a virtual event or live webcasting.

Curated chat groups (or chat rooms) are one way to look into this problem but it's a labor intensive method. However, curated groups cannot scale with the size of group nor can it reflect the dynamics of live groups. Often, the group owner of the curated group assumes the responsibility of labeling groups. However, the manual labeling cannot scale with the size of group or reflect its live dynamics.

Some other existing systems may provide the ability to display the number of active participants using heat map or numeric labeling. However, this is both insufficient and incorrect because the number of active participants still does not reflect group context or quality.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a diagram illustrating a method for asset acquisition for an online presentation method;

FIG. 2 is a diagram illustrating an example of an online presentation system that may use the presentation timeline annotation system;

FIG. 3 illustrates a system architecture of the online presentation system shown in FIG. 2;

FIG. 4 is a functional diagram of the interacting components of the online presentation system in FIG. 3;

FIG. 5 is a diagram illustrating a presentation workflow;

FIG. 6 is a diagram illustrating an example of an online presentation client that may incorporate part of the audience binning system;

FIG. 7 illustrates an example of the client and backend components of the audience binning system;

FIG. 8 illustrates a method for audience binning that may be carried out by the backend components in FIG. 7 and the client shown in FIG. 6;

FIG. 9 illustrates an example of table of user interest and experience tags;

FIG. 10 illustrates an example of webcast user interface with actionable buttons including audience binning;

FIG. 11 illustrates an example of a webcast user interface with an audience binning portion;

FIGS. 12A-B illustrate more details of an implementation of the audience binning;

FIG. 13 illustrates an example of a canvas for a webcast used for audience binning;

FIG. 14 illustrates an example of the canvas initialized with user interest and experiences;

FIG. 15 illustrates an example of audience binning in which all of the available spots for a given tag are exhausted;

FIG. 16 illustrates an example of audience binning in which a new layer is being formed to top of a layer in the canvas; and

FIG. 17 illustrates an example of a user interface showing the results of the audience binning.

DETAILED DESCRIPTION OF ONE OR MORE EMBODIMENTS

The disclosure is particularly applicable to an audience binning system and method for a webcast or virtual event presented using an online presentation system and it is in this context that the disclosure will be described. It will be appreciated, however, that the audience binning system and method has greater utility since it may be used to perform binning for other systems, such as chat rooms and the like in which it is desirable to be able to assess the interests and experience of each member and distribute the audience binning information.

The problem identified above may be tackled using the virtual audience binning system and method described below. The system and method dynamically labels a group with information derived from its current participants and possibly their conversations through data mining. New audience would use this contextual information to decide their relevance and interest with the groups as they are now. Furthermore, using the system, the quality of virtual binning increases with number of participants that solves the problem of size so that it is a solution that's built to work at scale.

With the introduction of the virtual audience binning, chat rooms and similar communication experience will be significantly enhanced. Specifically, audiences will be automatically grouped and presented as interactive hexagonal bins “beehives” of their interests or expertise. Each interest and expertise is assigned a color tag. One or more of these tags are selected by users at the time of registration. Now, a disclosure of an on-line web-based presentation system is provided wherein the on-line web-based presentation system may include the system and method for audience binning.

FIG. 1 is a diagram illustrating a method 20 for asset acquisition for online presentation event system. As shown, an audio/video or audio data source 22 is edited in step 24 if necessary or is automatically captured. In step 26, the data source 22 is encoded. Alternatively, an automated phone-based recording source 28 is encoded in step 30. The encoded data may then be stored in a media database 32, such as in a real media format 32a and/or a windows media format 32b. In this manner, a data source/piece of media is prepared for distribution using an event system, an example of which is shown in FIG. 2.

FIG. 2 is a diagram illustrating an event system 40 into which the presentation timeline annotation apparatus may be incorporated. The event system 40 may comprise an asset acquisition and event management portion 42, a database portion 44 and a distribution portion 46 wherein a piece of media/content 48 is input into the event system 40 in order to distribute that content/piece of media during the event. Generally, each element of the event system being described is implemented in software wherein each portion may be one or more software modules and each software modules may be a plurality of computer instructions being executed to perform a particular function/operation of the system. Each element of the system may thus be implemented as one or more computer resources, such as typical personal computers, servers or workstations that have one or more processors, persistent storage devices and memory with sufficient computing power in order to store and execute the software modules that form the frame event system in accordance with the invention. The event system may generate an event that is provided to one or more event clients 52 wherein each client is a computing resource, such as a personal computer, workstation, cellular phone, personal digital assistant, wireless email device, telephone, etc. with sufficient computing power to execute the event client located on the client wherein the client communicates with the event system over a wired or wireless connection.

In more detail, the asset acquisition and event management portion 42 may further comprise an asset acquisition portion 42a and an event management portion 42b wherein the asset acquisition portion performs one or more of the following functions: recording of the piece of media/content, editing of the piece of media/content, encoding of the piece of media/content and asset tagging. The event manager module 42b further comprises an asset manager module 50a, an event manager module 50b, a presentation manager module 50c and an encoder controller 50d. The asset manager module 50a, prior to an event, imports/exports content/pieces of media into/from a library of media as needed and manages the assets for each event presentation. The event manager module 50b may perform actions/function prior to and after an event. Prior to a particular event, the event manager module may reserve the event in the system (both resources and access points), set-up an event console which a user interacts with to manage the event and then send messages to each recipient of the upcoming event with the details of how to access/operate the event. After a particular event, the event manager module 50b may permit a user to import an old event presentation into the system in order to re-use one or more pieces of the old event presentation. The presentation manager module 50c, during a particular event presentation, generates an event file with the slides of the event presentation, URLs and polls to an encoder controller to distribute the particular event presentation to the users. The encoder controller 50d encodes the event presentation stream to one or more distribution server 54 that distributes the event presentation to the users.

As shown in FIG. 2, the database 44 may include data about each event, including the clients to which the event is being provided and the media associated with the event, one or more event users, the display of the particular event, the assets associated with the event, the metrics for the event and other event data. In combination with this data in the database for a particular event, operations and commands from the event manager module 42b are downloaded to the distribution servers 54 that distribute each event to each client 52 for the particular event over a distribution network 56. As shown, the event/presentation may be distributed to one or more different clients 52 that use one or more different methods to access the event. The clients 52 may include a client that downloads the presentation and then views the presentation offline.

FIG. 3 illustrates more details of the event system shown in FIG. 2. The event system may include a web server portion 60, an application server portion 62 and the database portion 40 (with the database 44) shown in FIG. 2. Each of these portions may be implemented as one or more computer resources with sufficient computing resources to implement the functions described below. In a preferred embodiment, each portion may be implemented as one or more well-known server computers. The web server portion 60 may further comprise one or more servlets 64 and a web container portion 66 which are both behind a typical firewall 68. In a preferred embodiment of the invention, the servlets reside on a BEA Weblogic system which is commercially available and may include an event registration servlet, an event manager module servlet, a presentation manager module servlet and an encoder controller servlet that correspond to the event manager module 50b, presentation manager module 50c and encoder controller 50c shown in FIG. 2. Each of these servlets implement the functions and operations described above for the respective portions of the system wherein each servlet is a plurality of lines of computer code executed on a computing resource with sufficient computing power and memory to execute the operations. The servlets may communicate with the application server portion 62 using well-known protocols such as, in a preferred embodiment, the well-known remote method invocation (RMI) protocol. The servlets may also communicate with the web container portion 66 which is preferable implemented using an well-known Apache/Weblogic system. The web container portion 66 generates a user interface, preferably using Perl, Active Server Page (ASP), HTML, XML/XSL, Java Applet, Javascript and Java Server Pages (JSPs.) The web container portion 66 may thus generate a user interface for each client and the presentation manager module user interface. The user interface generated by the web container portion 66 may be output to the clients of the system through the firewall as well as to an application demo server 68 that permits a demo of any presentation to be provided.

The application server portion 62 may preferably be implemented using an Enterprise JavaBeans (EJBs) container implemented using a BEA Weblogic product that is commercially sold. The application server management portion 62 may be known as middleware and may include a media metric manager 70a, a chat manager 70b, a media URL manager 70c, an event manager 70d, a presentation manager 70e and an event administration manager 70f which may each be software applications performed the specified management operations. The application server portion 62 communicates with the database 44 using a protocol, such as the well-known Java Database Connectivity (JDBC) protocol in a preferred embodiment of the invention. The database 44 may preferably be implemented using an Oracle 8/9 database product that is commercially available. As shown, the database 44 may include media data including URL data, slide data, poll data and document data. The database 44 may further include metric data, event data and chat data wherein the event data may further preferably include administration data, configuration data and profile data.

FIG. 4 is a diagram illustrating more details of the event database 44 in FIG. 3. As shown in FIG. 4, the database may generate data that is used to implement a function to reserve an event, to configure an event, present an event, for registration, for the lobby for the event console, for reporting and for archiving an event. The database may include asset data 44a that may be provided to the asset manager module 50a, metrics data 44b that is provided to a metric module 72, event data 44c that is provided to the event manager module 50b, presentation data 44d that is provided to the presentation manager module 50c, event user data 44e that is provided to an event registration module 80, display element data 44f that is provided to an event consoles module 76 and email notification data 44g that is provided to an email alerts module 74. The database may also store data that is used by a reporting module 78 to generate reports about the events and presentations provided by the system. The database may also store data that is used by a syndication module 82 to syndicate and replicate existing presentations.

FIG. 5 is a diagram illustrating an event center 90 that may be utilized by one or more users 92 that are presented with a presentation by the system and one or more presenters 94 who utilize the system to present presentations to the users 92. The users 92 may interact with a registration and lobby modules 80 that permit the users to register with the system and schedule a presentation to view. In response to a successful registration, the user may be presented with a player page 96, such as a web page provided to a client computer of the user, that provides the audio and visual data for the presentation, slides, polls and URLs for the presentation, chat sessions and question and answers for a particular presentation. The data in the player page 96 is provided by the web server 60, the media server 54 and a chat server 98 that provides the chat functionality for a presentation. The presentation data for a live event presentation is provided to the servers 54, 60 and 98 by the presentation manager module 50c. The presenters 94 may utilize the event manager module 50b to reserve an event and/or configure an event. Once the event is reserve and configured, the presentation data is forwarded to the presentation manager module 50c.

FIG. 6 is a diagram illustrating an example of an online presentation client 100 that may incorporate the presentation timeline annotation apparatus. The event client 100 may be implemented as a personal computer, workstation, PDA, cellular phone and the like with sufficient computing power to implement the functions of the client as described below. In the example shown in FIG. 6, the event client may be a typical personal computer that may further comprise a display unit 102, such as a CRT or liquid crystal display or the like, a chassis 104 and one or more input/output devices 106 that permit a user to interact with the client 100, such as, for example, a keyboard 106a and a mouse 106b. The chassis 104 may further include one or more processors 108, a persistent storage device 110, such as a hard disk drive, optical disk drive. tape drive, etc., and a memory 112, such as SRAM, DRAM or flash memory. In a preferred embodiment, the client is implemented as one or more pieces of software stored in the persistent storage device 110 and then loaded into the memory 112 to be executed by the processor(s) 108. The memory may further include an operating system 114, such as Windows, and a typical browser application 116, such as Microsoft Internet Explorer, Mozilla Firefox or Netscape Navigator and an event console module 118 (including a slide, polls, survey, URL, Q&A) that operates within the browser application. The client side of the system/apparatus is implemented as HTML and Javascript code that is downloaded/streamed to the client 100 during/prior to each presentation so that the synchronization of the assets does not require separate client software downloaded to the client.

The audience binning system may have a client-side element (an example of the user interface of which is shown in FIGS. 10-11) and backend components. Specifically, the backend components may be responsible for user modeling, syncing user status across clients and optionally performing mining of chat conversations. User modeling and mining were used in a broad sense. Mining techniques could be used (1) extract topic of conversations, (2) user sentiments about a given topic and (3) associate topics with users. The client side components may include binning logic, visualization and behavioral aspects as now described with reference to FIG. 7.

FIG. 7 illustrates an example of the client 118 and backend 62 components of the audience binning system. The audience binning system may include an audience binning user interface generation component 202 that may be part of the client and the audience binning user interface generation component may generate the user interfaces of the audience binning system such as shown, for example, in FIGS. 10-11. In addition, the audience binning system may include a binning synchronization component 204 that may be part of the backend/middleware and may distribute any audience binning data for each client to any other clients of the audience members of the presentation system. A single instance or a list of JSON data is used to synchronize user states and data. For example, iOS and Mac OS X system uses their propriety iCloud data structure to sync application and game states. WebSocket are used in HTMLS applications to push synced data to various clients. In addition, the audience binning system may include an audience binning component 206 that may part of the client and may generate the audience binning based on each user's interests and preferences as described in more detail below in FIGS. 12A and 12B. The components of the system shown in FIG. 7 may each be implemented in hardware, software or a combination of hardware and software. In a hardware/software implementation, each component may be a plurality of lines of computer code that may be resident in the memory of the cloud computing resources or one or more server computing resources and executed by the processor of the cloud computing resources or one or more server computing resources. Alternatively, each component may be a piece of hardware that implements the operations and processes described. For example, each component may be a programmable logic device, a microprocessor or microcontroller with microcode, an application specific integrated circuit and the like.

FIG. 8 illustrates a method 800 for audience binning that may be carried out by the backend components in FIG. 7 and the client shown in FIG. 6. In the method, each audience member of the presentation system (or other system) may submit interests and expertise when the audience members registers (802). An example of a table of the user interests and expertise are shown in FIG. 9. For example, in one implementation, at the time of registering for a webcast or virtual event audiences for the online presentation system in FIGS. 1-6 can feed their interests and specialization as tags or keywords. Submitted tags are stored in the cloud and synced with other active clients by the audience sync component 204.

All examples use JSON data structure in JavaScript execution environment. JSON is easily portable to other programming languages and environment.

Example 1

User data creation on sign-up

var user_data={

• • user_name: ‘John Appleseed’,
  • user_id: john@appleseed.com,
  • user_tags: [‘tag_1’, ‘tag_2’, ‘tag_3’]
  • . . .

}

Example 2

Server-side would inverse these user data into tag-user maps. This is sent to every client on loading the app for the first time.

var tag_list=[{

• • tag_id: ‘tag_123_456’,
  • tag_name: ‘tag_1’,
  • users: [‘john@appleseed.com’, ‘foo@bar.com’, . . . ]

}, {

• • tag_id: ‘tag_976_456’,
  • tag_name: ‘tag_2’,
  • users: [‘john@appleseed.com’, ‘user@domain.com’, . . . ]

}]

Example 3

Server would push updated and synced user data to the client every few seconds.

var diff_tags=[{

• • tag_id: ‘tag_976_456’,
  • new_user_joined: [‘user2@domain2.com’, ‘user3@domain3.com’],
  • old_user_left: [‘user1@domain1.com’, ‘user4@domain4.com’]

}];

Clients will use this pushed data to update their data model and reflect the changes in binning maps.

In the method, each audience member may take actions that may be logged by the client and sent to the backend system (804.) For example, in the online presentation system, the attendees take several actions during course of their session including but not limited to opening and viewing a webcast, listening to an audiocast, reading media slides, navigating across event locations and participating in virtual chat with other audiences. These are among the meaningful actions where virtual binning can be introduced. Client notifies server with users' action, which is then synced with other active clients over the socket or long-polling by the binning synch component 204. The client may generate an audience binning user interface (806.) For example, as shown in FIG. 10, a user interface 1000 for a presentation, such as a webcast or virtual event in the online presentation system, may be generated. The user interface may include actionable buttons or labels 1002, 1004 that may be placed over each webcast, audio cast, document, slides and location. For example, as shown in FIG. 10, the buttons may include a play/particular button 1002 so that the audience member can participate in the presentation and an audience binning button 1004. Clicking or hovering over these buttons display an image of virtual binning graph as shown in FIG. 11 (808) that details the composition of audiences who are currently viewing, listening or reading the underlying content. For example, as shown in FIG. 11, a user interface 1100 may include the presentation user interface and a binning user interface 1102. The binning user interface 1102 may also have additional actionable buttons, e.g. Join Conversation, Ignore Conversation, Show Trending Topics and Show Conversation Statistics. For example, as shown in FIG. 11, the buttons 1104 may include a join conversation button and a show trending topics. For example, clicking on Join Conversation button will open an existing chat widget in a well-defined context.

The method may thus generate audience binning user interfaces and may allow privileged members (e.g., members who have special access privileges, etc.) to initiate and engage with the right audience at the right time. Privileged users are defined by webcast (event) creator using managerial or administrative tools. They can interact and broadcast custom messages and media to the group members. It is analogous to posting an event flyer on the college notice board versus reaching out to specific interest group (club) and discussing the event in person. Now, more details of an implementation of the process for generating the audience binning is described in more detail.

FIGS. 12A-B illustrate more details of an implementation 1200 of the audience binning. The processes of the method described below may be carried out by the client shown in FIG. 6 and the components of the client such as the binning component 206 shown in FIG. 7. Thus, each client (for each user/audience member) performs its own audience binning based on the interests and expertise of the user of the particular client as well as the interests and expertise of the other users/audience members of the system that have been synched to the client. First, each user/audience members registers with the system, indicates interests and expertise and interacts with the system (1202.) Thus, a user u registers with the system and their interest(s) and expertise(s) are represented as tags t1, t2, t3 . . . ti. User interests and expertise are similar to what we find in sites like LinkedIn. Example: If the webcast or event is about Cloud Computing then list of use interests could be ‘Wearables’, ‘Smart Appliances’, ‘Smart Cars’, ‘Smartphones 2.0’, ‘Smart Travel’, ‘Personal Fitness’, ‘Health Care’, ‘Personalized Marketing’, ‘Customized Shopping’, ‘Personal Finance’, ‘The Digital Divide’, ‘Mobile Cash & Markets’, ‘Virtual Reality’. Each user may then click a button to watch a webcast, listen to an audio cast or read a slideshow. The method may then generate a canvas c of width w and height h in the DOM (Document Object Model (DOM) is a programming interface for HTML, XML and SVG documents). DOM provides APIs to get and set dimensions of various DOM elements like body, canvas and div etc. <canvas> is a HTML element which can be used to draw graphics using scripting (usually JavaScript). An example of the canvas is shown in FIG. 13 for a particular webcast. During this process, a total number of unique tags |Σti| is extracted out of all the viewer of the webcast (wc) based on the user data from the client and the other data from the other clients that has been synched to the client. Then, a total of |Σti| number of circles of identical radii are graphed and fitted into the canvas c using Circle Packing algorithm and the circles are scaled to maximize the packing density. Circle packing algorithms are described generally in more detail at http://en.wikipedia.org/wiki/Circle_packing_theorem which is incorporated herein by reference. Thus, as shown in the example in FIG. 13, there may be three unique tags which results in three circles centered around each tag within the canvas.

The method may then optimize the canvas for a particular event, such as a webcast or virtual event in the online presentation system (1206.) For example, for very large size audiences, sparsely populated tags can be removed or scaled down. Then, each remaining tag has a pre-assigned color, e.g. t1→ . . . , t2→ . . . and t3→ . . . so that the user can easily distinguish each tag in the user interface. Furthermore, the alpha opacity values of colors tags are reduced by 90% to 0.10.

The method may then initialize the binning in the canvas (1208.) Thus, for the particular user of the client on which the binning is being performed, the user tags are placed at the center of each unique tag circle. In one implementation, hexagonal shapes are used to depict these tags as shown in FIG. 13. Then, new users with different combination of tags clicks to view webcast wc. Thus, as shown in FIG. 14, each tag may have one or more hexagons representing the tags of the user and the other users of the system, such as users u2, u3, u3 and u4 in the example in FIG. 14. In the method, the newly joining audiences' tags may be placed alongside existing hexagonal bins using following heuristics—

• • tn←tag ti of newly joining user ui
  • to←oldest hexagon of similar type ti.
  • IF right side of to is unoccupied AND tn doesn't intersect circumference of circle ti THEN place tn to the right side of to. (i)
  • ELSE IF left side of to is unoccupied AND tn doesn't intersect circumference of circle ti THEN place tn to the left side of to. (ii)
  • ELSE IF top-right side of to is unoccupied AND tn doesn't intersect circumference of circle ti THEN place tn to the top-right side of to. (iii)
  • ELSE IF bottom-right side of to is unoccupied AND tn doesn't intersect circumference of circle ti THEN place tn to the bottom-right side of to. (iv)
  • ELSE IF top-left side of to is unoccupied AND tn doesn't intersect circumference of circle ti THEN place tn to the top-left side of to. (v)
  • ELSE IF bottom-left side of to is unoccupied AND tn doesn't intersect circumference of circle ti THEN place tn to the bottom-left side of to. (vi)
  • IF placement not available for to THEN SET to←second oldest hexagon of type ti AND REPEAT steps (i) through (vi)
  • IF placement not available for all to THEN start a new layer on top of existing hexagons AND REPEAT steps (i) through (vi)

The method may generate one or more audience binning user interfaces (examples of which are shown in FIGS. 15-17) (1212.) For example, FIG. 15 shows a state where all the available spots for a given layer is exhausted for tags of type t1 while FIG. 16 shows a state where new layer is being formed on top of existing layer. Addition of new layers makes hexagons more dense (opaque) signifying the higher volume of audiences of type t1. FIG. 17 is a user interface that shows a state where volume of audiences with tag type t1 is higher than the previous two illustrations. Translucent hexagons when layered on top of each other make them more opaque indicating more audience members. Thus, a user of the system may take an action, such as starting a chat session using the system, with a subset of the audience members that the user may select based on the audience binning.

The foregoing description, for purpose of explanation, has been described with reference to specific embodiments. However, the illustrative discussions above are not intended to be exhaustive or to limit the disclosure to the precise forms disclosed. Many modifications and variations are possible in view of the above teachings. The embodiments were chosen and described in order to best explain the principles of the disclosure and its practical applications, to thereby enable others skilled in the art to best utilize the disclosure and various embodiments with various modifications as are suited to the particular use contemplated.

The system and method disclosed herein may be implemented via one or more components, systems, servers, appliances, other subcomponents, or distributed between such elements. When implemented as a system, such systems may include an/or involve, inter alia, components such as software modules, general-purpose CPU, RAM, etc. found in general-purpose computers. In implementations where the innovations reside on a server, such a server may include or involve components such as CPU, RAM, etc., such as those found in general-purpose computers.

Additionally, the system and method herein may be achieved via implementations with disparate or entirely different software, hardware and/or firmware components, beyond that set forth above. With regard to such other components (e.g., software, processing components, etc.) and/or computer-readable media associated with or embodying the present inventions, for example, aspects of the innovations herein may be implemented consistent with numerous general purpose or special purpose computing systems or configurations. Various exemplary computing systems, environments, and/or configurations that may be suitable for use with the innovations herein may include, but are not limited to: software or other components within or embodied on personal computers, servers or server computing devices such as routing/connectivity components, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, set top boxes, consumer electronic devices, network PCs, other existing computer platforms, distributed computing environments that include one or more of the above systems or devices, etc.

In some instances, aspects of the system and method may be achieved via or performed by logic and/or logic instructions including program modules, executed in association with such components or circuitry, for example. In general, program modules may include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular instructions herein. The inventions may also be practiced in the context of distributed software, computer, or circuit settings where circuitry is connected via communication buses, circuitry or links. In distributed settings, control/instructions may occur from both local and remote computer storage media including memory storage devices.

The software, circuitry and components herein may also include and/or utilize one or more type of computer readable media. Computer readable media can be any available media that is resident on, associable with, or can be accessed by such circuits and/or computing components. By way of example, and not limitation, computer readable media may comprise computer storage media and communication media. Computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical storage, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and can accessed by computing component. Communication media may comprise computer readable instructions, data structures, program modules and/or other components. Further, communication media may include wired media such as a wired network or direct-wired connection, however no media of any such type herein includes transitory media. Combinations of the any of the above are also included within the scope of computer readable media.

In the present description, the terms component, module, device, etc. may refer to any type of logical or functional software elements, circuits, blocks and/or processes that may be implemented in a variety of ways. For example, the functions of various circuits and/or blocks can be combined with one another into any other number of modules. Each module may even be implemented as a software program stored on a tangible memory (e.g., random access memory, read only memory, CD-ROM memory, hard disk drive, etc.) to be read by a central processing unit to implement the functions of the innovations herein. Or, the modules can comprise programming instructions transmitted to a general purpose computer or to processing/graphics hardware via a transmission carrier wave. Also, the modules can be implemented as hardware logic circuitry implementing the functions encompassed by the innovations herein. Finally, the modules can be implemented using special purpose instructions (SIMD instructions), field programmable logic arrays or any mix thereof which provides the desired level performance and cost.

As disclosed herein, features consistent with the disclosure may be implemented via computer-hardware, software and/or firmware. For example, the systems and methods disclosed herein may be embodied in various forms including, for example, a data processor, such as a computer that also includes a database, digital electronic circuitry, firmware, software, or in combinations of them. Further, while some of the disclosed implementations describe specific hardware components, systems and methods consistent with the innovations herein may be implemented with any combination of hardware, software and/or firmware. Moreover, the above-noted features and other aspects and principles of the innovations herein may be implemented in various environments. Such environments and related applications may be specially constructed for performing the various routines, processes and/or operations according to the invention or they may include a general-purpose computer or computing platform selectively activated or reconfigured by code to provide the necessary functionality. The processes disclosed herein are not inherently related to any particular computer, network, architecture, environment, or other apparatus, and may be implemented by a suitable combination of hardware, software, and/or firmware. For example, various general-purpose machines may be used with programs written in accordance with teachings of the invention, or it may be more convenient to construct a specialized apparatus or system to perform the required methods and techniques.

Aspects of the method and system described herein, such as the logic, may also be implemented as functionality programmed into any of a variety of circuitry, including programmable logic devices (“PLDs”), such as field programmable gate arrays (“FPGAs”), programmable array logic (“PAL”) devices, electrically programmable logic and memory devices and standard cell-based devices, as well as application specific integrated circuits. Some other possibilities for implementing aspects include: memory devices, microcontrollers with memory (such as EEPROM), embedded microprocessors, firmware, software, etc. Furthermore, aspects may be embodied in microprocessors having software-based circuit emulation, discrete logic (sequential and combinatorial), custom devices, fuzzy (neural) logic, quantum devices, and hybrids of any of the above device types. The underlying device technologies may be provided in a variety of component types, e.g., metal-oxide semiconductor field-effect transistor (“MOSFET”) technologies like complementary metal-oxide semiconductor (“CMOS”), bipolar technologies like emitter-coupled logic (“ECL”), polymer technologies (e.g., silicon-conjugated polymer and metal-conjugated polymer-metal structures), mixed analog and digital, and so on.

It should also be noted that the various logic and/or functions disclosed herein may be enabled using any number of combinations of hardware, firmware, and/or as data and/or instructions embodied in various machine-readable or computer-readable media, in terms of their behavioral, register transfer, logic component, and/or other characteristics. Computer-readable media in which such formatted data and/or instructions may be embodied include, but are not limited to, non-volatile storage media in various forms (e.g., optical, magnetic or semiconductor storage media) though again does not include transitory media. Unless the context clearly requires otherwise, throughout the description, the words “comprise,” “comprising,” and the like are to be construed in an inclusive sense as opposed to an exclusive or exhaustive sense; that is to say, in a sense of “including, but not limited to.” Words using the singular or plural number also include the plural or singular number respectively. Additionally, the words “herein,” “hereunder,” “above,” “below,” and words of similar import refer to this application as a whole and not to any particular portions of this application. When the word “or” is used in reference to a list of two or more items, that word covers all of the following interpretations of the word: any of the items in the list, all of the items in the list and any combination of the items in the list.

Although certain presently preferred implementations of the invention have been specifically described herein, it will be apparent to those skilled in the art to which the invention pertains that variations and modifications of the various implementations shown and described herein may be made without departing from the spirit and scope of the invention. Accordingly, it is intended that the invention be limited only to the extent required by the applicable rules of law.

While the foregoing has been with reference to a particular embodiment of the disclosure, it will be appreciated by those skilled in the art that changes in this embodiment may be made without departing from the principles and spirit of the disclosure, the scope of which is defined by the appended claims.