| Patent application number | Description | Published |
|---|
| 20080208999 | METHOD AND SYSTEM FOR MEDIATING PUBLISHED MESSAGE STREAMS FOR SELECTIVE DISTRIBUTION - A computer implemented method, system and computer program product for delivering published messages to at least one subscriber in a publish-subscribe messaging system. A computer implemented method for delivering published messages to a subscriber includes receiving a plurality of message streams, and analyzing at least one message from each of the plurality of message streams in accordance with criteria established by the subscriber specifying a message content and a message content quality. At least one message that satisfies the criteria is delivered to the subscriber. | 08-28-2008 |
| 20080215751 | METHOD AND SYSTEM FOR CONTENT SIMILARITY-BASED MESSAGE ROUTING AND SUBSCRIPTION MATCHING - Computer implemented method, system and computer usable program code for routing messages in a message stream. A computer implemented method for routing messages in a message stream includes receiving a specification of desired messages, the specification containing a payload and receiving at least one message, the message containing a payload. The message payload is evaluated with respect to the specification payload and the specification, and the message is routed in accordance with the evaluation. | 09-04-2008 |
| 20080219554 | System and Method for Adaptively Separating Foreground From Arbitrary Background in Presentations - System and method for distinguishing between foreground content and background content in an image presentation. An initial background model is provided, and a final background model is constructed from the initial background model using the image presentation. The foreground content and background content in the image presentation are then distinguished from one another using the final background model. The present invention permits foreground content and background content to be separated from one another for further processing in different types of computer-generated image presentations such as digital slide presentations, video presentations, Web page presentations, and the like. | 09-11-2008 |
| 20080253621 | BRAIN SHAPE AS A BIOMETRIC - The invention provides a method, system, and program product for identifying an individual using biometric data based on the individual's brain. In one embodiment, the invention includes constructing a biometric signature based on at least one of: features within a two-dimensional scan of the individual's brain and a difference in features between at least two two-dimensional scans of the individual's brain. | 10-16-2008 |
| 20080263179 | SYSTEM AND METHOD FOR DYNAMICALLY UPDATING WEB PAGES USING MESSAGING-ORIENTED MIDDLEWARE - System, computer implemented method and computer program product for dynamically updating a Web page using browser-based messaging. A system for dynamically updating a Web page using browser-based messaging includes a Web page that includes a plurality of Web messaging tags, and a selected data model that can be bound to the Web messaging tags, and at least one messaging client for accepting at least one message from a message server and for processing the accepted at least one message into the selected data model. | 10-23-2008 |
| 20080270838 | DISTRIBUTED, FAULT-TOLERANT AND HIGHLY AVAILABLE COMPUTING SYSTEM - A method and system for achieving highly available, fault-tolerant execution of components in a distributed computing system, without requiring the writer of these components to explicitly write code (such as entity beans or database transactions) to make component state persistent. It is achieved by converting the intrinsically non-deterministic behavior of the distributed system to a deterministic behavior, thus enabling state recovery to be achieved by advantageously efficient checkpoint-replay techniques. The method comprises: adapting the execution environment for enabling message communication amongst and between the components; automatically associating a deterministic timestamp in conjunction with a message to be communicated from a sender component to a receiver component during program execution, the timestamp representative of estimated time of arrival of the message at a receiver component. At a component, tracking state of that component during program execution, and periodically checkpointing the state in a local storage device. Upon failure of a component, the component state is restored by recovering a recent stored checkpoint and re-executing the events occurring since the last checkpoint. The system is deterministic by repeating the execution of the receiving component by processing the messages in the same order as their associated timestamp. | 10-30-2008 |
| 20080306888 | STOCHASTIC CONTROL OPTIMIZATION FOR SENDER-BASED FLOW CONTROL IN A DISTRIBUTED STATEFUL MESSAGING SYSTEM - A method and system for controlling message flow in distributed stream processing. State transition probabilities in a Markov model having one state per staleness value of data are determined for sending or withholding updates of data to subscribers using expected message rates from an information provider. A cost function annotates each state transition in the model with a state transition cost for each decision to “send” or “withhold”. A propagation policy specifying whether to send or withhold the message is determined for each state. The propagation policy is then deployed. If a new message comprising an update of data is received during a lapsed time unit, a staleness value of the data held by subscribers is increased. The propagation policy is used to determine whether to send or withhold the message. If the message should be sent, the message is propagated and the staleness value of the data is reset. | 12-11-2008 |
| 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 |
| 20100042999 | TRANSACTIONAL QUALITY OF SERVICE IN EVENT STREAM PROCESSING MIDDLEWARE - Computer implemented method, system and computer usable program code for achieving transactional quality of service in a transactional object store system. A transaction is received from a client and is executed, wherein the transaction comprises reading a read-only derived object, or reading or writing another object, and ends with a decision to request committing the transaction or a decision to request aborting the transaction. Responsive to a decision to request committing the transaction, wherein the transaction comprises writing a publishing object, events are delivered to event stream processing queries, and are executed in parallel with executing of the transaction. Responsive to a decision to request committing a transaction that comprises reading a read-only derived object, a validation is performed to determine whether the transaction can proceed to be committed, whether the transaction should abort, or whether the validation should delay waiting for one or more event stream processing queries to complete. | 02-18-2010 |
| 20100057519 | SYSTEM AND METHOD FOR ASSIGNING SERVICE REQUESTS WITH DUE DATE DEPENDENT PENALTIES - A system and method for deciding assignments for service requests includes determining a best policy, within a class of index-based policies, based upon historic data for handling previous requests. If a service request is waiting to be handled, an index for service requests is determined based upon the best policy and service requests are assigned to agents based upon the index. Service requests are preempted if a waiting service has a higher index than other service requests. | 03-04-2010 |
| 20100205252 | Optimizing Migration Policy During Live Virtual Memory Migration - A mechanism for controlling live migration of a running application between a source machine and a target machine. At least one application characteristic and at least one network characteristic are obtained. An objective function that defines a cost to migrate from the source machine to the target machine as a function such as a weighted combination of at least one cost property is obtained. The objective function is optimized using the at least one application characteristic and the at least one network characteristic to determine a policy specifying when to switch execution of the running application from the source machine to the target machine. Live migration of the application from the source machine is controlled to send pages from the source machine to the target machine in accordance with the policy, and to switch the execution of the application from the source machine to the target machine at a state specified by the policy. | 08-12-2010 |
| 20110066459 | Correlated Analytics For Benchmarking In Community Shared Data - Exemplary embodiments of this invention provide a method that includes estimating an empirical distribution of a metric for a company. The method includes estimating a distribution of the metric for a plurality of companies. The method further includes determining whether the company is an outlier, based on the empirical distribution of the metric for the company and the distribution of the metric for the plurality of companies, and generating at least one recommendation based determining whether the company is an outlier. | 03-17-2011 |
| 20110078071 | PRIORITIZING LOANS USING CUSTOMER, PRODUCT AND WORKFLOW ATTRIBUTES - Data representative of a plurality of mortgage applications is obtained. The applications participate in a mortgage origination process, and each of the applications has associated therewith customer-specific attributes and product-specific attributes. The mortgage origination process has a plurality of statuses. Data representative of at least one environmental attribute is also obtained. Each given one of the mortgage applications in a given one of the plurality of statuses at a given time is ranked by likelihood of not closing, based at least on the customer-specific attributes, the product-specific attributes, and the at least one environmental attribute. Those of the mortgage applications likely not to close which are likely not to close due to non-exogenous attributes are identified. For at least some of the mortgage applications likely not to close due to non-exogenous attributes, suggestion of a modification of at least one corresponding one of the product-specific attributes is facilitated, to enhance the likelihood of closing. | 03-31-2011 |
