| Patent application number | Description | Published |
|---|
| 20100328311 | SYSTEM AND METHOD FOR ESTABLISHING CORRESPONDENCE, MATCHING AND REPAIRING THREE DIMENSIONAL SURFACES OF ARBITRARY GENUS AND ARBITRARY TOPOLOGY IN TWO DIMENSIONS USING GLOBAL PARAMETERIZATION - A system, method and computer program product for parameterizing a 3D surface of genus g and arbitrary topology to the 2D plane. The method includes receiving an input 3D mesh of genus g; computing n discrete harmonic one-forms on the surface of the mesh to obtain n numbers for every edge in the graph represented by an input mesh; selecting two compatible linearly independent discrete harmonic one-forms for parameterization; assigning an arbitrary vertex in the mesh as an origin, and then summing each of the two harmonic one-forms along the edges of the graph using a traversal strategy to form 2D coordinates for every other vertex of the mesh to form the 2D parameterization of the 3D surface; detecting all singularities in the 2D parameterization; and, removing faces connected to the singularity and parameterizing the vertices of the removed faces using a 2D parameterization method, and connecting these vertices using a 2D polygonalization algorithm. Using the 3D mapping methodology employed, a correspondence function is computed that can be used to match two 3D object surfaces and repair meshes of arbitrary genus. | 12-30-2010 |
| 20110055426 | DYNAMIC AND EVOLUTIONARY PLACEMENT IN AN EVENT-DRIVEN COMPONENT-ORIENTED NETWORK DATA PROCESSING SYSTEM - Method, system and computer readable program code for dynamic and evolutionary component placement in an event processing system having producers, consumers, a plurality of nodes between the producers and the consumers, and a flow graph representing operator components to be executed between the producers and the consumers. A description of a change to the system is received. At each node, next-hop neighbor nodes for each consumer are identified. A routing value is assigned to each next-hop neighbor node for each consumer and the routing values are updated according to an update rule that represents a chromosome in a routing probe. The update rule in a routing probe is selectively updated from a plurality of update rules at the consumer. The probability of selecting a particular update rule is reinforced or decayed based on the success of an update rule in allowing routing probes to create many different efficient routes. At each producer, nests of scouting probes are adaptively selected from an available set of nests and dispatched to execute hypothetical placement of a query by an independent agent called a “leader”. A placement of the operator components that minimizes performance cost of the system relative to the hypothetical placement is selected. Each scouting probe contains chromosomes that guide placement. Scouting probes in two different nests have different chromosomes. The performance cost of the hypothetical changed placement is evaluated and the performance evaluation is used to evolve at least one chromosome of a scouting ant in each nest. | 03-03-2011 |
| 20110087732 | LINKING VIRTUAL WORLDS AND COLLABORATION PLATFORMS BI-DIRECTIONALLY USING A CENTRAL IDENTITY MANAGEMENT SYSTEM - A method, information processing system, and computer program storage product link information associated with a virtual world with information associated with a social collaboration platform. A virtual world user identifier and a social collaboration platform user identifier are stored. The virtual world identifier is associated with a set of virtual world contacts for the respective user. The social collaboration platform user identifier is associated with a set of social collaboration contacts for the user. The virtual world user identifier is linked to the social collaboration platform user identifier. An association is determined between at least one of the set of social collaboration contacts and the virtual world identifier set of virtual world contacts and the social collaboration platform user identifier, respectively, for the respective user. An information set associated with at least one of the virtual world user identifier and the social collaboration identifier is updated to include the association. | 04-14-2011 |
| 20110087968 | MANAGING CONNECTIONS BETWEEN REAL WORLD AND VIRTUAL WORLD COMMUNITIES - A method, information processing system, and computer program storage product manage connections between a virtual world and a social network. A set of virtual world information and a set of social network information are analyzed. A graph including a plurality of vertices is generated. Each vertex represents one of virtual world information and social network information. Each vertex is coupled to at least one other vertex by a respective edge. At least one edge of the graph couples a first vertex representing virtual world information and a second vertex representing social network information. At least one vertex is determined to be an articulation point having a respective edge. The removal of the respective edge of the articulation point causes a disconnection of the virtual world information from the social network information within the graph. A user is notified via a graphical user interface that the graph comprises the articulation point. | 04-14-2011 |
| 20120101974 | Predicting Outcomes of a Content Driven Process Instance Execution - A method for predictive analytics in a semi-structured process including receiving traces of the semi-structured process, at least one of the traces including a document content value, determining a process model from the traces, the process model comprising tasks at nodes of the semi-structured process and embodies all possible execution sequences in the process, determining a probabilistic graph including a probability at each of the tasks of the semi-structured process advancing from one task to another task, and combining the process model and probabilistic graph to determine a probabilistic process model including probabilities and strengths of transitions between tasks. | 04-26-2012 |
| 20120259865 | AUTOMATED CORRELATION DISCOVERY FOR SEMI-STRUCTURED PROCESSES - A computer-implemented method, system, and article of manufacture for determining a set of correlated data among heterogeneous computer applications. The method includes providing a computer system having software modules, receiving statistics on data relating to a first event and a second event, generating a confidence score for an attribute set, where the attribute set includes an attribute from the first event data and an attribute from the second event data, and selecting the attribute set as a set of correlated data if the confidence score is within a threshold value. | 10-11-2012 |
| 20130103441 | Generating Predictions for Business Processes Whose Execution is Driven by Data - A method for generating predictions includes dividing a business process model into fragments, wherein the business process model includes task nodes and at least one decision node, determining the decision node in at least one of the fragments, determining a decision tree for each decision node, determining a probability for reaching a terminal node in each fragment, and merging the probabilities obtained from the fragments to find a probability of a future task. | 04-25-2013 |
| 20130231978 | INTEGRATED CASE MANAGEMENT HISTORY AND ANALYTICS - A method, system and computer program product for determining health of a case. The method includes the steps of: obtaining at least one correlated trace from (i) task descriptions or (ii) data related to the task descriptions or a process instance; calculating at least one current metric using (i) the task descriptions, (ii) the data, (iii) the correlated trace or (iv) a first model; calculating at least one prognostic metric using a second model; and creating at least one combination metric from the current metric and the prognostic metric; where at least one of the steps is carried out using a computer device. | 09-05-2013 |
| 20130311242 | Business Process Analytics - A system for visualizing a process includes a trace manager receiving a plurality of trace sets, each trace set having a plurality of business process execution traces, each of the business process execution traces being a representation of an individual work flow, a model generator creating a model from each of the trace sets, each model being a directed graph including a work flow of an aggregate of the business process execution traces in a respective trace set, a model comparator extracting a plurality of differences between the models and creating a comparison result based on the plurality of differences, wherein the comparison result is stored to a collaborative system, and a trace set identifier configured to identify a subset of the trace set based on a selected subsection of the model, where the subset of trace set exhibits at least one difference extracted from the selected subsection of the model. | 11-21-2013 |
| Patent application number | Description | Published |
|---|
| 20120197861 | INTELLIGENT CONTENT DISCOVERY FOR CONTENT CONSUMERS - Embodiments of the present invention provide a method, system and computer program product for intelligent content discovery for content consumers in the global Internet. In an embodiment of the invention, a method for intelligent content discovery for content consumers includes parsing a list of previously viewed content in a content browser executing in memory of a computer to identify different content sources for the previously viewed content. The method also includes directing crawling of the content sources over a computer communications network to retrieve updated content from the content sources. The method yet further includes filtering the updated content into a subset of updated content according to at least one parameter corresponding to one of an end user profile of an end user and an end user preference of the end user. Finally, the method includes presenting a list of the subset of updated content in the content browser. | 08-02-2012 |
| 20120203551 | AUTOMATED FOLLOW UP FOR E-MEETINGS - Embodiments of the present invention provide a method, system and computer program product for automated follow-up for e-meetings. In an embodiment of the invention, a method for automated follow-up for e-meetings is provided. The method includes monitoring content provided to an e-meeting managed by an e-meeting server executing in memory of a host computer. The method also includes applying a rule in a rules base to the monitored content. Finally, the method includes triggering generation of a follow up item in response to applying the rule to the monitored content. | 08-09-2012 |
| 20120203845 | AUTOMATED SOCIAL NETWORK INTRODUCTIONS FOR E-MEETINGS - Embodiments of the present invention provide a method, system and computer program product for automated social networking for e-meetings. In an embodiment of the invention, a method for automated social networking for e-meetings is provided. The method includes monitoring content provided to an e-meeting managed by an e-meeting server executing in memory of a host computer. The method further includes detecting a name in the monitored content and comparing the detected name to names in a contact list for a social networking system executing externally to the e-meeting. Finally, the method includes triggering generation of a social networking introduction for the name to different participants to the e-meeting in response to matching the detected name to a name in the contact list. | 08-09-2012 |
| 20120259792 | AUTOMATIC DETECTION OF DIFFERENT TYPES OF CHANGES IN A BUSINESS PROCESS - Systems and methods are provided for the automatic detection of different types of changes in a business process. A system includes a transformer for performing a transformation on data derived from process traces or models extracted from the processes traces to generate transformed data. The process traces are for a business process corresponding to a set of related tasks for a specified goal. Each of the models has at least a transition matrix of dimension N×N, where N is a total number of the related tasks. The system further includes a change detector for performing change detection on the transformed data to identify at least one of when a change occurs in the business process and a degree of the change. | 10-11-2012 |
| 20120323827 | Generating Predictions From A Probabilistic Process Model - A method for predictive analytics in a semi-structured process including updating, iteratively, at least one probability of a probabilistic process model based on a completed task, wherein updating the at least one probability of the probabilistic process model includes receiving the probabilistic process model associated with a todo list including a plurality of tasks of the semi-structured process, defining a cost of each of the plurality of tasks, prioritizing the plurality of tasks according to the costs, and recommending a next task from the todo list according to a prioritization | 12-20-2012 |
| 20130086125 | PRESENTING INFORMATION FROM HETEROGENEOUS AND DISTRIBUTED DATA SOURCES WITH REAL TIME UPDATES - Receiving from each of a plurality of low level monitor models an outbound event comprising information associated with a respective data source. The information received in each of the outbound events can be collected to a global monitoring context in which the information is automatically aggregated. Via a global cube associated with the global monitoring context, the information can be presented in a report. At least one new outbound event can be received. The new outbound event can include updated information associated with at least one of the data sources. Responsive to receiving the new outbound event, the information presented the report can be updated in real time to reflect the updated information. | 04-04-2013 |
| 20130110812 | ACCOUNTING FOR AUTHORSHIP IN A WEB LOG SEARCH ENGINE | 05-02-2013 |
| 20140039972 | AUTOMATIC DETECTION OF DIFFERENT TYPES OF CHANGES IN A BUSINESS PROCESS - Systems and methods are provided for the automatic detection of different types of changes in a business process. A system includes a transformer for performing a transformation on data derived from process traces or models extracted from the processes traces to generate transformed data. The process traces are for a business process corresponding to a set of related tasks for a specified goal. Each of the models has at least a transition matrix of dimension N×N, where N is a total number of the related tasks. The system further includes a change detector for performing change detection on the transformed data to identify at least one of when a change occurs in the business process and a degree of the change. | 02-06-2014 |
| 20140089319 | ONLINE MEDIA SHARING WITH ACTIVITY BALANCING AND INCENTIVES - Activity is balanced in a media sharing environment. To balance the activity, a computer determines the uploading activity of a plurality of members of a media sharing environment, as well as the tagging activity of the plurality of members. The computer compares the uploading activity to the tagging activity and determines a scoring coefficient responsive to the comparison. The computer determines a member score for one of the plurality of members based on the scoring coefficient. The computer can subject the member to discipline if the member score violates a low threshold, or to a reward if the member score violates a high threshold. The scoring coefficient can be determined to induce the plurality of members to favor either one of the uploading activity and the tagging activity over the other. | 03-27-2014 |
| 20140214971 | ESTABLISHING AN AUTOMATIC COMMUNICATIONS DELAY BASED ON SOCIAL OR BUSINESS NETWORK FACTORS - Methods and arrangements for imparting a communications delay. A delay is dynamically determined for sending an outgoing communication. The determining includes using information derived from at least one of: a social network graph and a business network graph, and the determined delay is applied to the outgoing communication. | 07-31-2014 |
| 20140214973 | ESTABLISHING AN AUTOMATIC COMMUNICATIONS DELAY BASED ON PREVAILING ACTIVITY FACTORS - Methods and arrangements for imparting a communications delay. A delay is dynamically determined for sending an outgoing communication. The determining includes using information derived from a determination of a prevailing activity level of a sender, and the determined delay is applied to the outgoing communication. | 07-31-2014 |
| 20140297240 | EXTRACTING CLINICAL CARE PATHWAYS CORRELATED WITH OUTCOMES - Systems and methods for data analysis include constructing patient traces as a set of medical events for each patient of a patient population, the patient population being segmented based on patient outcomes. Medical events in one or more of the patient traces are reduced to provide processed patient traces. The processed patient traces are clustered to identify a cluster of patient traces. A process model is mined, using a processor, representing an aggregation of treatment pathways in the patient traces from the cluster. Patterns from patient traces are identified that are discriminative of patient outcomes. At least one of the patterns is represented with respect to the process model to identify treatment pathways correlated with the patient outcomes. | 10-02-2014 |
| 20140297317 | EXTRACTING KEY ACTION PATTERNS FROM PATIENT EVENT DATA - Systems and methods for data analysis include determining a patient trace as a set of medical events for a patient. Medical events of the patient trace are grouped into subsets of medical events using a processor according to a temporal relationship between the medical events. Co-occurring events are identified from the subsets of medical events as event clusters. A plurality of medical events in one or more of the subsets of the patient trace is represented using the event clusters to condense the patient trace. | 10-02-2014 |
| 20140297323 | EXTRACTING KEY ACTION PATTERNS FROM PATIENT EVENT DATA - Systems and methods for data analysis include determining a patient trace as a set of medical events for a patient. Medical events of the patient trace are grouped into subsets of medical events using a processor according to a temporal relationship between the medical events. Co-occurring events are identified from the subsets of medical events as event clusters. A plurality of medical events in one or more of the subsets of the patient trace is represented using the event clusters to condense the patient trace. | 10-02-2014 |
| 20140297324 | EXTRACTING CLINICAL CARE PATHWAYS CORRELATED WITH OUTCOMES - Systems and methods for data analysis include constructing patient traces as a set of medical events for each patient of a patient population, the patient population being segmented based on patient outcomes. Medical events in one or more of the patient traces are reduced to provide processed patient traces. The processed patient traces are clustered to identify a cluster of patient traces. A process model is mined, using a processor, representing an aggregation of treatment pathways in the patient traces from the cluster. Patterns from patient traces are identified that are discriminative of patient outcomes. At least one of the patterns is represented with respect to the process model to identify treatment pathways correlated with the patient outcomes. | 10-02-2014 |
| 20140304340 | SYSTEM AND METHOD TO BREAK COMMUNICATION THREADS - A method and system for breaking a communications thread on a communications system includes monitoring a communications system having a plurality of users. An initial communications thread is identified between two or more of the plurality of users on the communications system. The initial communications thread is broken based on a criteria. The criteria includes a user initiated break wherein a user selectively breaks the initial communications thread. New communications threads are generated from the break in the initial communications thread which include, a first thread including communications before the break and a second thread including communications after the break. A link may be generated in each of the first and second threads referring to the other thread such that the initial communications thread is reconstituted when either of the links are selected. | 10-09-2014 |
| 20140324516 | EXPEDITED PROCESS EXECUTION USING PROBABILITIES - Embodiments relate to determining a process outcome based on a computed probability and altering the path of a process instance based on an expediting rule. An aspect includes executing, by a processing device, a process instance in a process diagram, which includes a plurality of process steps. A condition associated with a first process step is identified. An outcome for the first process step is then determined based on a computed probability. Accordingly, the first process step is bypassed and the process instance is branched to a second process step based on an expediting rule. The expediting rule includes the condition and a branching action according to a selected outcome. | 10-30-2014 |
| 20140324759 | EXPEDITED PROCESS EXECUTION USING PROBABILITIES - Embodiments relate to determining a process outcome based on a computed probability and altering the path of a process instance based on an expediting rule. An aspect includes executing, by a processing device, a process instance in a process diagram, which includes a plurality of process steps. A condition associated with a first process step is identified. An outcome for the first process step is then determined based on a computed probability. Accordingly, the first process step is bypassed and the process instance is branched to a second process step based on an expediting rule. The expediting rule includes the condition and a branching action according to a selected outcome. | 10-30-2014 |
| 20140350983 | PROVIDING BEST PRACTICE WORKFLOW TO AID USER IN COMPLETING PROJECT THAT IS CONSTANTLY UPDATED BASED ON USER FEEDBACK - A method, system and computer program product for providing a best practice workflow to aid a user in completing a project. A system receives practice instances for completing a project (e.g., obtaining a job), where a “practice instance” refers to a graph of nodes and directed edges, where each node represents a task in a process for completing the project and each directed edge illustrates an execute sequence between two tasks. The system receives rankings from users (“crowdsourcing”) for each of these practice instances and computes a single ranking for each practice instance based on these received rankings. The system may then generate a workflow for completing a project based on these practice instances with a single ranking that exceeds a threshold and are directed to completing the same project. By using user feedback to rank these practice instances, a more effective and useful workflow will be generated. | 11-27-2014 |
| 20140350994 | PROVIDING BEST PRACTICE WORKFLOW TO AID USER IN COMPLETING PROJECT THAT IS CONSTANTLY UPDATED BASED ON USER FEEDBACK - A method, system and computer program product for providing a best practice workflow to aid a user in completing a project. A system receives practice instances for completing a project (e.g., obtaining a job), where a “practice instance” refers to a graph of nodes and directed edges, where each node represents a task in a process for completing the project and each directed edge illustrates an execute sequence between two tasks. The system receives rankings from users (“crowdsourcing”) for each of these practice instances and computes a single ranking for each practice instance based on these received rankings. The system may then generate a workflow for completing a project based on these practice instances with a single ranking that exceeds a threshold and are directed to completing the same project. By using user feedback to rank these practice instances, a more effective and useful workflow will be generated. | 11-27-2014 |
| 20150019298 | ESTIMATING PATH INFORMATION IN BUSINESS PROCESS INSTANCES WHEN PATH INFORMATION INFLUENCES DECISION - Systems and methods for predicting trace information include determining a plurality of trace candidates for one or more traces having missing path information, the plurality of trace candidates having path information for tasks of a business process model, which includes a plurality of independent parallel paths. Probabilities that each of the plurality of trace candidates for the business process model is an actual trace are computed using a processor for the one or more traces. One of the plurality of trace candidates is identified as the actual trace based on the probabilities to predict path information of the one or more traces. | 01-15-2015 |
| 20150127588 | PRUNING PROCESS EXECUTION LOGS - Methods and systems for pruning process execution logs include learning a predictive model from a set of execution traces that characterize a process, where the predictive model determines a likelihood of a given instance reaching a specified outcome; identifying attributes in the predictive model that fall below a threshold measure of relevance to the specified outcome using a processor; and removing the identified attributes from the set of execution traces. | 05-07-2015 |
| 20150127589 | ITERATIVE REFINEMENT OF PATHWAYS CORRELATED WITH OUTCOMES - A method for refining a process model includes mining a process model from a set of execution traces; determining whether the process model is too dense or too sparse; learning a predictive model from the execution traces to predict an outcome; modifying the predictive model; and mining a refined process model from updated traces based on attributes present in the modified predictive model. Modifying the predictive model includes making the predictive model more specific if it is determined that the process model is too dense; and making the predictive model more general if it is determined that the process model is too sparse. | 05-07-2015 |
| 20150128034 | ACHIEVING BETTER CASE OUTCOMES THROUGH THE USE OF AGGREGATE CASE HISTORIES - A method of case management includes receiving a plurality of previously executed case instances, receiving a selection of current case attributes and at least one candidate case outcome during runtime of a currently executing case instance, and generating a visual representation of case distributions using the previously executed case instances. The visual representation depicts a correlation between the current case attributes and the at least one candidate case outcome, and is generated using analytics applied to the plurality of previously executed case instances. | 05-07-2015 |
| 20150207781 | TRANSMITTING A HIDDEN COMMUNICATION - A first communication element is received on a communicating device. A defined mapping is identified based on an identification of a recipient device. The first communication element is mapped to a second communication element based on the defined mapping. The mapped communication element is provided to the recipient device. | 07-23-2015 |
| 20150207830 | DYNAMIC PROFILE SHARING USING EXPIRING TOKENS - Access to a user profile of a user device at a location may be provided to a destination device upon detecting that the location is within a proximity of a destination location. An expiring token may be generated, associated with the user profile, and communicated to the second device. Access to the user profile provided to the destination device may be terminated upon an expiration of the expiring token. | 07-23-2015 |
| 20150254216 | CONTEXTUAL HYPERLINK INSERTION - In a method for identifying and inserting hyperlinks within a software application, a processor receives a request for one or more recommended hyperlinks, wherein the request corresponds to a location for a hyperlink insertion in the software application. A processor receives contextual information about the request. A processor identifies one or more hyperlinks corresponding to the contextual information. A processor receives a selected hyperlink from the one or more hyperlinks. A processor inserts the selected hyperlink at the location in the software application. | 09-10-2015 |
| 20150264054 | COLLABORATION SPACE WITH EVENT-TRIGGER CONFIGURATION VIEWS - Protecting sensitivity of information in a shared collaborative space on a computer network includes associating a set of sensitivity levels to sets of users and to sets of data elements. Access by each user to the shared collaborative space may be restricted to those data elements that have the same sensitivity level as of the user. Where multiple users join a single session, only data elements having a lowest common sensitivity level are made accessible by the users of the session. | 09-17-2015 |
| 20150324241 | LEVERAGING PATH INFORMATION TO GENERATE PREDICTIONS FOR PARALLEL BUSINESS PROCESSES - Systems and methods for determining a representation of an execution trace include identifying at least one execution trace of a business process model, the business process model including parallel paths where a path influences an outcome of a decision. Path information of the business process model is determined using a processor, the path information including at least one of task execution order for each parallel path, task execution order across parallel paths, and dependency between parallel paths. A path representation for the at least one execution trace is selected based upon the path information to determine a representation of the at least one execution trace. | 11-12-2015 |
| Patent application number | Description | Published |
|---|
| 20140114671 | MAPPING A CARE PLAN TEMPLATE TO A CASE MODEL - A method of mapping a care plan template to a case model includes receiving a care plan template, extracting elements from the care plan template, wherein the elements correspond to a phase comprising at least one task and data attributes corresponding to the task, mapping the task of the care plan template to a task of the case model, mapping a precedence relationship of the task of the care plan template to preconditions of the task of the case model, mapping the data attributes of the care plan template to properties of the case model, wherein the properties are associated with the task of the case model, mapping the task of the care plan template to a role of the case model, and generating the case model including the mapped task, the mapped precedence relationship, the mapped data attributes, and the mapped role. | 04-24-2014 |
| 20140114673 | MAPPING A CARE PLAN TEMPLATE TO A CASE MODEL - A method of mapping a care plan template to a case model includes receiving a care plan template, extracting elements from the care plan template, wherein the elements correspond to a phase comprising at least one task and data attributes corresponding to the task, mapping the task of the care plan template to a task of the case model, mapping a precedence relationship of the task of the care plan template to preconditions of the task of the case model, mapping the data attributes of the care plan template to properties of the case model, wherein the properties are associated with the task of the case model, mapping the task of the care plan template to a role of the case model, and generating the case model including the mapped task, the mapped precedence relationship, the mapped data attributes, and the mapped role. | 04-24-2014 |
| 20140365403 | GUIDED EVENT PREDICTION - A method (and structure) for implementing a software tool, as executable by a processor on a computer to exercise any of a plurality of prediction tools. Questions are provided to a user output port, and inputs from a user input port are received as responses to the questions. The question responses are used to instantiate, customize, and configure a specific one of said plurality of prediction tools for executing a specific application on the software tool. | 12-11-2014 |
| Patent application number | Description | Published |
|---|
| 20090259769 | Dynamic Component Placement in an Event-Driven Component-Oriented Network Data Processing System - Method, system and computer usable program code for dynamic component placement in an event processing system having producers, consumers, a plurality of nodes between the producers and the consumers, and a flow graph representing computational components to be executed between the producers and the consumers. A description of a change to the system is received. At each node, next-hop neighbor nodes for each consumer are identified. A routing value is assigned to each next-hop neighbor node for each consumer. Using the routing values in a context of the change, a performance cost of the system is estimated based on hypothetical changed placements of the computational components at nodes along paths from a producer to a consumer through the next-hop neighbor nodes for each consumer, and a changed placement of the computational components that minimizes performance cost of the system relative to the hypothetical changed placements is selected. | 10-15-2009 |
| 20110047554 | DECENTRALIZED LOAD DISTRIBUTION TO REDUCE POWER AND/OR COOLING COSTS IN AN EVENT-DRIVEN SYSTEM - A computer-implemented method, computer program product and computer readable storage medium directed to decentralized load placement in an event-driven system so as to minimize energy and cooling related costs. Included are receiving a data flow to be processed by a plurality of tasks at a plurality of nodes in the event-driven system having stateful and stateless event processing components, wherein the plurality of tasks are selected from the group consisting of hierarchical tasks (a task that is dependent on the output of another task), nonhierarchical tasks (a task that is not dependent on the output of another task) and mixtures thereof. Nodes are considered for quiescing whose current tasks can migrate to other nodes while meeting load distribution and energy efficiency parameters and the expected duration of the quiesce provides benefits commensurate with the costs of quiesce and later restart. Additionally, tasks are considered for migrating to neighbor nodes to distribute the system load of processing the tasks and reduce cooling costs. | 02-24-2011 |
| 20110047555 | DECENTRALIZED LOAD DISTRIBUTION IN AN EVENT-DRIVEN SYSTEM - A computer-implemented method, computer program product and computer readable storage medium directed to decentralized load distribution in an event-driven system. Included are receiving a data flow to be processed by a plurality of tasks at a plurality of nodes in the event-driven system having stateful and stateless event processing components, wherein the plurality of tasks are selected from the group consisting of hierarchical tasks (a task that is dependent on the output of another task), nonhierarchical tasks (a task that is not dependent on the output of another task) and mixtures thereof. Tasks are considered for migration to distribute the system load of processing tasks. The target node, to which the at least one target task is migrated, is chosen wherein the target node meets predetermined criteria in terms of load distribution quality. The computer-implemented method, computer program product and computer readable storage medium of the present invention may also include migrating tasks to target nodes to reduce cooling costs and selecting at least one node to go into quiescent mode. | 02-24-2011 |
| 20110267350 | Adaptive Process Simplification of Mined Business Process Graphs Using Tutte Parameterizations - A method of graph simplification includes receiving a connected process graph having a plurality of edges and nodes, parameterizing the connected process graph to determine a mapping where none of the edges overlap, defining respective energies for a plurality of triangles formed by the edges and the nodes in the connected process graph, identifying node clusters in the connected process graph, and collapsing, for each node cluster, ones of the edges and nodes in the connected process graph that are not critical edges or critical nodes according to the energies. | 11-03-2011 |
| 20110267351 | Dynamic Adaptive Process Discovery and Compliance - A method for modeling a process includes collecting data pertaining to executed process steps from one or more activity log files. The collected data is parsed to determine a set of process steps that have been performed. An incidence value representing how many times each performed process step follows each of the other performed process steps is determined. A graph representing a model of the executed process by representing each process step that has been performed as a node of the graph and each transition between process steps within each process thread as an edge on the graph is generated. The edges connecting the pairs of nodes are assigned numbers that depend upon the incidence value corresponding to how many times the process step represented by a first node of the pair is followed by the process step represented by a second node of the pair. | 11-03-2011 |
| 20110270853 | Dynamic Storage and Retrieval of Process Graphs - A method for modeling a process includes receiving a plurality of graphs representing processes wherein for each graph. A sequence of process steps of the processes are represented as nodes and edges connecting pairs of nodes represent transitions between process steps. A numeric value representative of graph appearance for each of the plurality of received graphs is calculated. Each of the plurality of received graphs is stored within a tree-like data structure according to its corresponding numeric value. Each of the above steps is performed using a computer system. | 11-03-2011 |
| 20120059820 | Aggregation, Organization and Provision of Professional and Social Information - A method for performing a search for information pertaining to a search subject includes receiving a name of a person. A social/professional value is received. A search is performed based on the received name. A plurality of personal candidates is identified from results of the search and profiles of the same person in different search domains are automatically linked. A search subject is selected from among the identified plurality of candidates based on user input. The search results are characterized along a scale from social information to professional information. The search results are filtered based on the received value indicative of the desired level and the characterization of each item of results found. The filtered search results are displayed. | 03-08-2012 |
| 20130254778 | DECENTRALIZED LOAD DISTRIBUTION TO REDUCE POWER AND/OR COOLING COSTS IN AN EVENT-DRIVEN SYSTEM - A computer program product and computer readable storage medium directed to decentralized load placement in an event-driven system so as to minimize energy and cooling related costs. Included are receiving a data flow to be processed by a plurality of tasks at a plurality of nodes in the event-driven system having stateful and stateless event processing components, wherein the plurality of tasks are selected from the group consisting of hierarchical tasks (a task that is dependent on the output of another task), nonhierarchical tasks (a task that is not dependent on the output of another task) and mixtures thereof. Nodes are considered for quiescing whose current tasks can migrate to other nodes while meeting load distribution and energy efficiency parameters and the expected duration of the quiesce provides benefits commensurate with the costs of quiesce and later restart. | 09-26-2013 |
| 20140067446 | TRAINING DECISION SUPPORT SYSTEMS FOR BUSINESS PROCESS EXECUTION TRACES THAT CONTAIN REPEATED TASKS - A method for training a machine learning tool to generate a prediction in a business process includes receiving a business process model corresponding to the business process, the business process model including a plurality of tasks, identifying a cycling set at a decision point in the business process model, wherein the cycling set comprises at least one task that the business process model iterates through, and building a training table by determining a total number of sub-traces and a total number of variables from a plurality of execution traces of the business process model based on the cycling set identified at the decision point, wherein a new row of the training table is created for each of the sub-traces and a new column of the training table is created for each of the variables. | 03-06-2014 |
| 20140067732 | TRAINING DECISION SUPPORT SYSTEMS FROM BUSINESS PROCESS EXECUTION TRACES THAT CONTAIN REPEATED TASKS - A method for training a machine learning tool to generate a prediction in a business process includes receiving a business process model corresponding to the business process, the business process model including a plurality of tasks, identifying a cycling set at a decision point in the business process model, wherein the cycling set comprises at least one task that the business process model iterates through, and building a training table by determining a total number of sub-traces and a total number of variables from a plurality of execution traces of the business process model based on the cycling set identified at the decision point, wherein a new row of the training table is created for each of the sub-traces and a new column of the training table is created for each of the variables. | 03-06-2014 |
