Abstract: The present disclosure relates to photo-curable resins, and, more particularly, to 3D-printable, surface-eroding, acrylic anhydride-based resins, including both acrylated and methacrylated chemistries. In a preferred embodiment, the resins compositions are degradeable. The disclosure also provides methods of preparing the photo-curable resins and embodiments of degradeable objects comprised of the photo-curable resins.

Abstract: Some embodiments provide a greeting card or a postcard with a practical joke feature. The practical joke feature can include a sound that is repeatedly played for several hours, days, weeks, etc. The card can include a mode of operation configured to allow a purchaser to experience the sound without arming the practical joke feature. The card can include a pouch that contains one or more surprises for card recipients that attempt to open or destroy the card. The card can include one or more features that resist destruction of the card and/or internal components of the card that implement the practical joke feature.

Abstract: Some embodiments provide a greeting card or a postcard with a practical joke feature. The practical joke feature can include a sound that is repeatedly played for several hours, days, weeks, etc. The card can include a mode of operation configured to allow a purchaser to experience the sound without arming the practical joke feature. The card can include a pouch that contains one or more surprises for card recipients that attempt to open or destroy the card. The card can include one or more features that resist destruction of the card and/or internal components of the card that implement the practical joke feature.

Abstract: Some embodiments provide a greeting card or a postcard with a practical joke feature. The practical joke feature can include a sound that is repeatedly played for several hours, days, weeks, etc. The card can include a mode of operation configured to allow a purchaser to experience the sound without arming the practical joke feature. The card can include a pouch that contains one or more surprises for card recipients that attempt to open or destroy the card. The card can include one or more features that resist destruction of the card and/or internal components of the card that implement the practical joke feature.

Abstract: Some embodiments provide a greeting card or a postcard with a practical joke feature. The practical joke feature can include a sound that is repeatedly played for several hours, days, weeks, etc. The card can include a mode of operation configured to allow a purchaser to experience the sound without arming the practical joke feature. The card can include a pouch that contains one or more surprises for card recipients that attempt to open or destroy the card. The card can include one or more features that resist destruction of the card and/or internal components of the card that implement the practical joke feature.

Abstract: Some embodiments provide a greeting card or a postcard with a practical joke feature. The practical joke feature can include a sound that is repeatedly played for several hours, days, weeks, etc. The card can include a mode of operation configured to allow a purchaser to experience the sound without arming the practical joke feature. The card can include a pouch that contains one or more surprises for card recipients that attempt to open or destroy the card. The card can include one or more features that resist destruction of the card and/or internal components of the card that implement the practical joke feature.

Abstract: Some embodiments provide a greeting card or a postcard with a practical joke feature. The practical joke feature can include a sound that is repeatedly played for several hours, days, weeks, etc. The card can include a mode of operation configured to allow a purchaser to experience the sound without arming the practical joke feature. The card can include a pouch that contains one or more surprises for card recipients that attempt to open or destroy the card. The card can include one or more features that resist destruction of the card and/or internal components of the card that implement the practical joke feature.

Abstract: Some embodiments provide a greeting card or a postcard with a concealed feature, such as, for example, a practical joke feature. The concealed feature can include concealed hardware that repeatedly plays a sound for several hours, days, or weeks. The concealed feature can include a concealed keeper element or pouch that contains a payload, such as, for example, confetti, glitter, stickers, or toys. The card can include a mode of operation configured to allow a card-giver to inspect and/or write on the interior of the card without activating a concealed feature. The card can be configured to release the contents of the keeper element or pouch when a recipient attempts to open or destroy the card. The card can include one or more features that resist destruction of the card and/or internal components of the card that implement a concealed feature or a practical joke feature.

Abstract: The current document is directed to methods and systems that receive instrumentation-generated events and that employ statistical inference to discover event topics and to assign a topic or category to each of a number of events. In a described implementation, the events comprise key/value pairs. A seeded local/global-topic latent Dirichlet allocation methods is used to discover topics and assign topics to a set of events. The topic-assigned events are then processed to generate topic signatures, using which the methods and systems assign topics to subsequently received messages.

Abstract: Systems and methods are disclosed for providing a meta-social graph. In accordance with one implementation, a computerized method comprises collecting a plurality of different online identities of a first online user, each of the different online identities corresponding to a unique social network system. The method also includes collecting a plurality of communication data associated with the first user and determining bi-directional connections of the first user with other users from the collected communication data. In addition, the method may also include creating a meta-social graph from the determined bi-directional connections and the plurality of different online identities and generating a global identifier for the first user. The method also includes storing, in at least one memory device, the meta-social graph with at least one of the generated global identifier, the determined bi-directional connections, and the collected communication data.

Abstract: Computerized systems and methods are disclosed for analyzing search query relationships and managing electronic content. In accordance with one implementation, log data pertaining to a plurality of queries may be received over an electronic network. A click graph may be generated representing one or more relationships between the queries. Further, temporal similarities may be identified between the queries, for example, by looking at peaks in frequency of queries over time. A pair of search queries may be evaluated based on the generated click graph and the identified temporal similarities to determine whether the queries in the pair are related.

Abstract: The current document is directed to methods and systems that receive instrumentation-generated events and that employ statistical inference to discover event topics and to assign a topic or category to each of a number of events. In a described implementation, the events comprise key/value pairs. A seeded local/global-topic latent Dirichlet allocation methods is used to discover topics and assign topics to a set of events. The topic-assigned events are then processed to generate topic signatures, using which the methods and systems assign topics to subsequently received messages.

Abstract: Computerized systems and methods are disclosed for analyzing search query relationships and managing electronic content. In accordance with one implementation, log data pertaining to a plurality of queries may be received over an electronic network. A click graph may be generated representing one or more relationships between the queries. Further, temporal similarities may be identified between the queries, for example, by looking at peaks in frequency of queries over time. A pair of search queries may be evaluated based on the generated click graph and the identified temporal similarities to determine whether the queries in the pair are related.

Abstract: Computer-implemented systems and methods are provided for tracking the usage of digital assets is disclosed. In one implementation, a method is provided that comprises sending a request to a digital asset management system to acquire a digital asset from a digital asset provider and receiving an asset identifier for the digital asset from the digital asset management system. The method also includes sending the asset identifier to a content management system and receiving publication information from the content management system. In addition, the method includes tracking the publication of the digital asset based on the publication information.

Abstract: Systems and methods are disclosed for providing a meta-social graph. In accordance with one implementation, a computerized method comprises collecting a plurality of different online identities of a first online user, each of the different online identities corresponding to a unique social network system. The method also includes collecting a plurality of communication data associated with the first user and determining bi-directional connections of the first user with other users from the collected communication data. In addition, the method may also include creating a meta-social graph from the determined bi-directional connections and the plurality of different online identities and generating a global identifier for the first user. The method also includes storing, in at least one memory device, the meta-social graph with at least one of the generated global identifier, the determined bi-directional connections, and the collected communication data.

Abstract: A list of “hot topics” may be provided to a user to indicate information that is currently popular. A topic may be deemed popular when a large number of search queries related to the topic are entered by users. A search system may receive and analyze an electronic source of published information to determine a reason for why a particular popular topic is popular. If content related to why a particular popular topic is popular exists in multiple electronic sources of published information, text summarization techniques may be used to determine a reason for why the popular topic is popular by from among the multiple electronic sources of published information.

Abstract: Computerized systems and methods are disclosed for analyzing search query relationships and managing electronic content. In accordance with one implementation, log data pertaining to a plurality of queries may be received over an electronic network. A click graph may be generated representing one or more relationships between the queries. Further, temporal similarities may be identified between the queries, for example, by looking at peaks in frequency of queries over time. A pair of search queries may be evaluated based on the generated click graph and the identified temporal similarities to determine whether the queries in the pair are related.

Abstract: A list of “hot topics” may be provided to a user to indicate information that is currently popular. A topic may be deemed popular when a large number of search queries related to the topic are entered by users. A search system may receive and analyze an electronic source of published information to determine a reason for why a particular popular topic is popular. If content related to why a particular popular topic is popular exists in multiple electronic sources of published information, text summarization techniques may be used to determine a reason for why the popular topic is popular by from among the multiple electronic sources of published information.

Abstract: A list of “hot topics” may be provided to a user to indicate information that is currently popular. A topic may be deemed popular when a large number of search queries related to the topic are entered by users. A search system may receive and analyze an electronic source of published information to determine a reason for why a particular popular topic is popular. If content related to why a particular popular topic is popular exists in multiple electronic sources of published information, text summarization techniques may be used to determine a reason for why the popular topic is popular by from among the multiple electronic sources of published information.

Abstract: A list of “hot topics” may be provided to a user to indicate information that is currently popular. A topic may be deemed popular when a large number of search queries related to the topic are entered by users. A search system may receive and analyze an electronic source of published information to determine a reason for why a particular popular topic is popular. If content related to why a particular popular topic is popular exists in multiple electronic sources of published information, text summarization techniques may be used to determine a reason for why the popular topic is popular by from among the multiple electronic sources of published information.