Abstract: The subject innovation provides for systems and methods to facilitate weighted suffix tree clustering. Conventional suffix tree cluster models can be augmented by incorporating quality measures to facilitate improved performance. Further the quality measure can be employed in determining cluster labels that show improvements in accuracy over conventional means. Additionally “stopnodes” can be defined to facilitate traversing suffix tree models efficiently. Quality measurements can be determined based in part on weighting factors applied to terms in a vector model, said terms being mapped from a suffix tree model.

Abstract: Transaction systems and methods for advancing a committed time in the future are described herein. In the present transaction systems and methods, the first end can be permitted to pre-hatch a time capsule signature before the committed time. The time capsule signature scheme here is conducted based on an identity-based trapdoor relation (IDTR). Moreover, an extended time capsule signature scheme is conducted based on an extended identity-based trapdoor relation (IDTR). By using an extended IDTR primitive, the present transaction systems and methods can distinguish the time capsule signature is validated before or after the committed time t.

Abstract: The subject innovation provides for systems and methods to facilitate weighted suffix tree clustering. Conventional suffix tree cluster models can be augmented by incorporating quality measures to facilitate improved performance. Further the quality measure can be employed in determining cluster labels that show improvements in accuracy over conventional means. Additionally “stopnodes” can be defined to facilitate traversing suffix tree models efficiently. Quality measurements can be determined based in part on weighting factors applied to terms in a vector model, said terms being mapped from a suffix tree model.

Abstract: The subject innovation provides for systems and methods to facilitate weighted suffix tree clustering. Conventional suffix tree cluster models can be augmented by incorporating quality measures to facilitate improved performance. Further the quality measure can be employed in determining cluster labels that show improvements in accuracy over conventional means. Additionally “stopnodes” can be defined to facilitate traversing suffix tree models efficiently. Quality measurements can be determined based in part on weighting factors applied to terms in a vector model, said terms being mapped from a suffix tree model.

Abstract: Methods for gaining profit of a sponsored keyword auctioneer are described herein. The method begins with holding a local keyword auction, and receiving bids for it, wherein each bid is for the right to display one advertisement associated with the bid in response to the bid being allocated along with one keyword. Bid for the same keyword at other auctions are placed. Once the bidders of the local keyword auction to adjust bids, the bid at the external auction is changed by utilizing a forward looking Nash equilibrium response function.

Abstract: Systems and methods for facilitating more efficient bidding in an ad-words auction are described herein. An auctioning component can employ a forward-looking Nash equilibrium to facilitate an ad-words auction. A bidding component can enable bidding agents to place bids in the ad-words auction as a function of dynamically considering at least existing strategies of other bidding agents and future responses of the other bidding agents. Bidding agents associated with bids comprising higher true private values can obtain advertisement slots within the ad-words auction that are associated with a higher order of attractiveness to viewers—a bidding agent's true private value can be based on, at least in part, the bidding agent's estimate of value that at least one user interested in a particular keyword places on the bidding agent's product(s) and/or service(s).

Abstract: The subject innovation provides for systems and methods to facilitate weighted suffix tree clustering. Conventional suffix tree cluster models can be augmented by incorporating quality measures to facilitate improved performance. Further the quality measure can be employed in determining cluster labels that show improvements in accuracy over conventional means. Additionally “stopnodes” can be defined to facilitate traversing suffix tree models efficiently. Quality measurements can be determined based in part on weighting factors applied to terms in a vector model, said terms being mapped from a suffix tree model.

Abstract: Systems and methods for facilitating more efficient bidding in an ad-words auction are described herein. An auctioning component can employ a forward-looking Nash equilibrium to facilitate an ad-words auction. A bidding component can enable bidding agents to place bids in the ad-words auction as a function of dynamically considering at least existing strategies of other bidding agents and future responses of the other bidding agents. Bidding agents associated with bids comprising higher true private values can obtain advertisement slots within the ad-words auction that are associated with a higher order of attractiveness to viewers—a bidding agent's true private value can be based on, at least in part, the bidding agent's estimate of value that at least one user interested in a particular keyword places on the bidding agent's product(s) and/or service(s).

Abstract: Methods for gaining profit of a sponsored keyword auctioneer are described herein. The method begins with holding a local keyword auction, and receiving bids for it, wherein each bid is for the right to display one advertisement associated with the bid in response to the bid being allocated along with one keyword. Bid for the same keyword at other auctions are placed. Once the bidders of the local keyword auction to adjust bids, the bid at the external auction is changed by utilizing a forward looking Nash equilibrium response function.

Abstract: Transaction systems and methods for advancing a committed time in the future are described herein. In the present transaction systems and methods, the first end can be permitted to pre-hatch a time capsule signature before the committed time. The time capsule signature scheme here is conducted based on an identity-based trapdoor relation (IDTR). Moreover, an extended time capsule signature scheme is conducted based on an extended identity-based trapdoor relation (IDTR). By using an extended IDTR primitive, the present transaction systems and methods can distinguish the time capsule signature is validated before or after the committed time t.