EMOTION PROCESSING SYSTEMS AND METHODS

• US 20150150023A1
• Filed: 11/21/2014
• Published: 05/28/2015
• Est. Priority Date: 11/22/2013
• Status: Active Grant

• Current Assignee: TNHC Investments LLC
• Original Assignee: Decooda International, Inc.
• Inventors: Johnson, David, Wardell, Charles
• Granted Patent: US 9,727,371 B2
• Time in Patent Office: Days
• US Class Current: 718/107
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques
• CPC Class Codes: G06F 16/9535 Search customisation based on user profiles and personalisation
• CPC Class Codes: G06F 16/9538 Presentation of query results
• CPC Class Codes: G06F 2209/5017 Task decomposition
• CPC Class Codes: G06F 40/30 Semantic analysis
• CPC Class Codes: G06F 9/4806 Task transfer initiation or dispatching
• CPC Class Codes: G06F 9/4843 by program, e.g. task dispatcher, supervisor, operating system
• CPC Class Codes: G06F 9/5027 the resource being a machine, e.g. CPUs, Servers, Terminals
• CPC Class Codes: G06F 9/5072 Grid computing
• CPC Class Codes: G06Q 10/06 Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
• CPC Class Codes: G06Q 30/0203 Market surveys; Market polls
• CPC Class Codes: G06Q 30/0282 Rating or review of business operators or products
• CPC Class Codes: G06Q 30/0631 Item recommendations
• CPC Class Codes: G06Q 50/01 Social networking

Abstract

A system for conducting parallelization of tasks is disclosed. The system includes an interface for receiving messages comprising a representation of logic describing two tasks to be executed in parallel, the message further comprising a content payload for use in the tasks. The system further includes a parallel processing grid comprising devices running on independent machines, each device comprising a processing manager unit and at least two processing units. The processing manager is configured to parse the received messages and to distribute the at least two tasks to the at least two processing units for independent and parallel processing relative to the content payload.

Claims

1. A system for conducting parallelization of tasks, comprising:

an interface for receiving messages comprising a representation of logic describing two tasks to be executed in parallel, the message further comprising a content payload for use in the tasks; and

a parallel processing grid comprising devices running on independent machines, each device comprising a processing manager unit and at least two processing units, wherein the processing manager is configured to parse the received messages and to distribute the at least two tasks to the at least two processing units for independent and parallel processing relative to the content payload.

2. The system of claim 1, further comprising:

a messaging source having a website crawler, the website crawler configured to generate the message having the representation of logic describing two tasks to be executed in parallel and the content payload for use in the tasks.

3. The system of claim 1, further comprising:

a messaging source having a streaming data interface for receiving streaming data, wherein the messaging source is configured to process the streaming data and to generate the message using the streaming data.

4. The system of claim 3, wherein the messaging source is configured to use the streaming data to create the payload and wherein the identification of the tasks are not a part of the original streaming data.

5. The system of claim 1, further comprising:

a messaging source comprising a query engine for querying a data source and for generating a series of the messages using the query results, wherein the identification of the tasks are not a part of the query result data.

6. The system of claim 1, wherein the interface comprises a framework manager configured to queue the messages, and wherein each processing manager unit is configured to request new messages from the queue when resources permit.

7. The system of claim 1, wherein the messages are not compiled and do not include the source code for the tasks, and wherein the messages utilize a mark-up language to identify the tasks to be completed in parallel and the content payload.

8. The system of claim 7, wherein the content payload comprises a reference to data not embedded within the message.

9. The system of claim 7, wherein the identification of the parallel tasks comprise a listing of the tasks to be completed in parallel and wherein each item of the list refers to a function to be executed by the processing units;

wherein the processing units are general purpose processing units configured to identify the function and to recall resources for executing the function from a plug-in library.

10. A computerized method for processing tasks:

receiving a message describing at least two processing tasks to be parallelized and completed relative to a payload content of the message;

parsing the received message to identify the at least two tasks for parallelization;

distributing the tasks, in parallel, to a discrete processing unit;

at each discrete processing unit, completing the entirety of its task asynchronously with another discrete processing unit.

11. The method of claim 10, further comprising:

generating the message having the representation of logic and the content payload by crawling a changing web-based data source and creating a message for discrete updates to the data source.

12. The method of claim 10, further comprising:

generating the message using streaming data to create the payload and wherein the identification of the tasks are not a part of the original streaming data.

13. The method of claim 10, further comprising:

generating the message using the a query engine, by querying a data source and generating a series of the messages using the query results, wherein the identification of the tasks are not a part of the query result data.

14. The method of claim 10, wherein a processing manager unit conducts the receiving, parsing, and distribution steps, the method further comprising:

queuing the received messages at a framework manager;

at each processing manager unit, requesting new messages from the queue when resources permit.

15. The method of claim 10, wherein the messages are not compiled and do not include the source code for the tasks, and wherein the messages utilize a mark-up language to identify the tasks to be completed in parallel and the content payload.

16. The method of claim 15, wherein the content payload comprises a reference to data not embedded within the message.

17. The method of claim 15, wherein the identification of the parallel tasks comprises a listing of the tasks to be completed in parallel and wherein each item of the list refers to a function to be executed by the processing units;

wherein the discrete processing units are general purpose processing units configured to identify the function and to recall resources for executing the function from a plug-in library.

18. The method of claim 17, wherein the function is an emotional scoring function.

19. The method of claim 18, wherein the emotional scoring function is a task in parallel with a context determination task.

20. The method of claim 19, wherein the function includes an emotional scoring function for a first emotion and another task includes an emotional scoring function for a second emotion, wherein both emotion scoring functions are executed as parallel tasks and represented as parallel tasks in the logic of the message.