ADVERTISEMENT SELECTION SYSTEMS AND METHODS FOR INTERNET ARTICLES |
USA
|
Abstract
Advertisement selection systems and methods for internet articles are provided. A personal advertisement agent generates an article characteristic value according to an internet article edited by a content editor. An advertisement server selects at least one of the advertisements according to the article characteristic value, a specialty characteristic value, and advertisement characteristic values of respective advertisements, wherein the specialty characteristic value is generated according to historical articles published by the client. The selected advertisement is integrated and published with the internet article.
|
METHOD AND SYSTEM OF GENERATING AND DETECTING CONFUSING PHONES OF PRONUNCIATION |
USA
|
Abstract
A method of generating and detecting confusing phones/syllables is disclosed. The method includes a generating stage and a detecting stage. The generating stage includes: (a b c d e b c d f g h i j) compare the most likely route of the spoken sentence with the target route of the spoken sentence to detect pronunciation error and give high-level pronunciation suggestions.
|
METHOD AND SYSTEM FOR COMPLEX EVENT PROCESSING |
USA
|
Abstract
A method for complex event processing is disclosed. An event correlation engine detects various event correlation rules to analyze events to be detected and then retrieves event processing languages from an event definition storage module to implement and receive other relative events using a process engine.
|
NEGOTIATION SUPPORT SYSTEMS AND METHODS |
USA
|
Abstract
Systems for negotiation support. First and second negotiation agent modules respectively receive multiple first proposals, calculate preference scores (PSs) for each first proposal using utility models and select a portion of the first proposals as second proposals in descending order according to the calculated PSs therewith. The negotiation management module receives the second proposals from the first and second negotiation modules, and generates third proposals according to the received proposals. The first and second negotiation agent modules respectively receive the third proposals, calculate PSs for received proposals using utility models, and arrange the third proposals in descending order according to PSs therewith to generate voting results. The negotiation management module receives the voting results, and generates a final agreement according to the received voting results.
|
PATENT SUMMARIZATION SYSTEMS AND METHODS |
USA
|
Abstract
Methods for patent summarization are disclosed. A digital file comprising an issued patent document or a published application is acquired. At least one claim string is acquired from the digital file. Multiple elements are acquired from the claim string. A part-of relationship architecture among a portion of the elements is generated according to the claim string. At least one is-a relationship for at least one of the elements is generated according to the claim string. At least one association relationship for at least one of the elements is generated according to the claim string. The part-of relationship architecture, as-is relationship and association relationship are displayed.
|
AUCTION NEGOTIATION SUPPORT SYSTEMS AND METHODS |
USA
|
Abstract
Methods for auction negotiation support executed by a negotiator agent module are provided. The best bid corresponding to a product/service and a total number of negotiator agent modules placing the best bid are received. It is determined that a bid is placed by a following strategy or an exceeding strategy. The following strategy indicates that, when the received best bid is not equal to the prior bid placed by the negotiator agent module, the negotiator agent module places the bid equal to the received best bid. The exceeding strategy indicates that, when the inverse of the total number of negotiator agent modules placing the best bid is lower than a predetermined threshold, the negotiator agent module places the bid advanced to the received best bid.
|
METHOD AND SYSTEM FOR DYNAMIC EVENT MATCHING |
USA
|
Abstract
A method for dynamic event matching. A domain model for each domain is defined. Individual requirements and preferences of a user are modeled to create a personal model. Dynamic requirements of a specific domain for the user are modeled. A dynamic event is generated. The dynamic event is obtained using an information server for format transformation to create an event model. The personal model is matched with the event model using a content-based method according to the domain model and the dynamic event. The user is informed of the matching results. The matching results are adjusted according to user feedback.
|
Complex event evaluation systems and methods |
USA
|
Abstract
Complex event evaluation systems and methods are disclosed. A mathematics model for complex events and corresponding factors, and calculates a critical level of respective complex events according to weightings of respective factors in the mathematics model are provided. If several complex events occur simultaneously, a priority of respective complex events is calculated according to the historic occurrence of respective complex events. The critical level and priority of respective complex events are provided to users for decision making. Additionally, the mathematics model is established and adjusted according to the feedback scores for complex events.
|
VIDEO CONVERSION METHODS FOR FRAME RATE REDUCTION |
USA
|
Abstract
A video conversion method for frame rate reduction. Video data comprising at least one I-frame and a plurality of B- and P-frames is provided. The B- and P-frames are converted to P-frames using a first image processing method, thereby leaving the I-frame and a plurality of P-frames. A frame rate reduction operation is implemented based on the converted frames using a second image processing method.
|
METHOD AND COMPUTER PROGRAM PRODUCT FOR A NEW NODE JOINING A PEER TO PEER NETWORK AND COMPUTER READABLE MEDIUM AND THE NETWORK THEREOF |
USA
|
Abstract
A peer to peer network, a method, a computer program product for a new node joining the network and a computer readable medium are disclosed. The peer to peer network comprises a plurality of nodes and a new node. Each of the nodes has its own partner list. Each of the partner lists records nodes that are able to provide data to the owner of the partner list. The nodes recorded in the partner list are called the partners of the owner of the partner list. When the new node intends to join the network, each of the nodes of the network decides whether to accept the new node according to the number of its partners but not according to a random manner. The stability of the network can be enhanced and the load of the network can be balanced.
|