Abstract: Distributed privacy preserving data mining techniques are provided. A first entity of a plurality of entities in a distributed computing environment exchanges summary information with a second entity of the plurality of entities via a privacy-preserving data sharing protocol such that the privacy of the summary information is preserved, the summary information associated with an entity relating to data stored at the entity. The first entity may then mine data based on at least the summary information obtained from the second entity via the privacy-preserving data sharing protocol. The first entity may obtain, from the second entity via the privacy-preserving data sharing protocol, information relating to the number of transactions in which a particular itemset occurs and/or information relating to the number of transactions in which a particular rule is satisfied.

Abstract: A parsing module receives a web page from a network. The parsing module identifies a frame embedded within the intercepted web page. The parsing module identifies information regarding the embedded frame. A collection module collects the identified information regarding the embedded frame and maintains such information in an exclusion list stored in a memory module. A lookup module intercepts a web page from the network before the web page reaches the client. The lookup module identifies information regarding this web page and accesses the memory module to determine if the identified information is included in the exclusion list. If the identified information regarding the web page is not included in the exclusion list, a modification module modifies the web page such that the web page will not be loaded on the client within a frame.

Abstract: An integrated customer communications computer system is configured to provide outbound customer communications. The communications computer system generates documents associated with the communications in a predefined format, in real-time or in batch, by merging templates comprising static data received from a template repository, dynamic data received from at least one component of an account opening system, and static content for the templates received from a content repository. The communications computer system includes a communication manager, a plurality of transmission channels, an interface for managing the templates and the content, and a document repository. Various embodiments are described, including a computer implemented method of providing customer communications using an integrated customer communications component and/or module.

Abstract: A system and method for digitally classifying and analyzing exposure to behavioral influencers to probabilistically determine behaviors likely to be demonstrated by an individual or cohorts of individuals based on a combination of demographic and psychographic attributes. The system and method transforms raw data into useful data elements having associated exteroceptive values and other metadata that is useful for further evaluation, analysis, integration into a model, or other behavioral data utilization.

Abstract: A technique can include identifying a collection of documents to be clustered. The collection of documents can include foreign language documents and base language documents. The foreign language documents can be translated into the base language at a base language translation module. Keywords in the base language documents and keywords in the translated foreign language documents can be determined at a document indexing module. The base language documents can be clustered with the foreign language documents in a common set of document clusters based on the determined keywords in the base language documents and the determined keywords in the translated foreign language documents. In response to a search query in a first language, a listing of search results can be provided that includes documents in the first language and another language from the a common document cluster.

Abstract: An approach is presented for generating a log parser. A tokenized log comprising elements is generated by delimiting a sample log based on a token. Matches between elements and attributes of fields of the sample log are determined. Positions of the matched elements are determined. Based on the matches, a ranking of the token is determined, which indicates a first likelihood that the token is a delimiter that delimits parts of the sample log. Another ranking of another token is determined, which indicates a second likelihood that the other token is the delimiter. A parser is generated based on the positions, the matches and the token. Based on the first likelihood exceeding the second likelihood, a result of parsing the sample log using the parser is presented without presenting another result of parsing the log using another parser based on the other token.

Abstract: A full-text search index for a table stored in a set of partitions of a database is refreshed. At a first point in time, table row distribution information and a table partitioning list are captured. At a second point in time, it is determined that an index refresh operation is to be performed. The captured table row distribution information is compared with current table row distribution information to determine whether there is at least one difference. In response to the determining that there is at least one difference, a text index distribution is re-aligned for any table rows that are affected by the change in table data row distribution by: generating a new table partitioning list, and indexing documents associated with table data rows that moved from one partition in the captured table partitioning list to another partition in the new table partitioning list.

Abstract: Methods, systems, and computer-readable media provide for the modification of network source content. According to various embodiments described herein, source content that includes primary source content and secondary source content is received via a network. Secondary source content is identified for modification. Insertion content is identified for use in modifying the secondary source content. The secondary source content is then modified prior to providing the modified source content to a user device for presentation to a user. Content management criteria that may include provider agreements, user preferences, and a user profile may be used in the content modification procedure.

Abstract: A transaction processing device including: a representative key decision portion for deciding a representative key to be any one of the keys of every record of a record group as an object for maintaining consistency in a transaction process; a log compilation portion for updating a subordinate log by adding consistence object information indicating the object for maintaining the consistency to the subordinate log other than a representative log corresponding to the representative key among the logs corresponding to every record of the record group; a log update portion for updating the representative log by writing update information for every record of the record group into the representative log; and a record update portion for updating every record by reflecting the update information written into the representative log in the every record of the record group.

Abstract: Method, media, and systems for compressing objects, comprising: receiving a request to write a first object including a first key and a first value, wherein the first object is of a given type; receiving a request to write a second object including a second key and a second value, wherein the second object is of the given type; classifying the first object to a compression dictionary according to at least one rule based on a value of the first object and/or the key of the first object; classifying the second object to the compression dictionary according to at least one rule based on a value of the second object and/or the key of the second object; and compressing the first object and the second object based on the compression dictionary.

Abstract: An approach for visualizing versions of a hierarchically organized object is presented. A measure of similarity is computed between each version and a standard version. Versions having identical hierarchies are clustered into sets of versions. Versions within each of the sets of versions are organized according to the computed similarity measures. A visualization is generated as a plot having first and second dimensions. The first dimension represents similarity between a set of versions and the standard version. The second dimension represents similarity between a version and the standard version. In one embodiment, the visualization includes, in a first area, information from multiple hierarchical levels of the standard version and includes, in a second area, information from only the root node level of the other versions. After receiving an approval of a version in the second area, the approved version may replace the standard version in the first area.

Abstract: The present disclosure describes garbage collection that provides prompt reclamation of large objects. A heap space is divided into Young regions, Old regions, and Humongous regions. A remembered set is created and maintained, during the execution of one or more programs, for each region that specifies where there are references from outside the region to inside the region. A garbage collection list is generated specifying regions to perform garbage collection on. All Young regions and at least one Humongous region are included in the garbage collection list. If it is determined to include Old regions, the Old regions are selected and included in the garbage collection list. Then, a garbage collection is performed on the regions specified in the garbage collection list. During the garbage collection, the indication for each region is utilized to determine reachable objects in the region, ensuring that reachable objects are not deallocated.

Abstract: Providing category information includes: receiving a plurality of search key word sets that were previously input by a plurality of users; obtaining category information corresponding to the plurality of search key word sets; segmenting each of the plurality of search key word sets into search key word units; combining the search key word units into a plurality of search key word unit groups that correspond to a plurality of stages; based at least in part on the category information, determining category information that specifically corresponds to the plurality of search key word unit groups; and based at least in part on category information, establishing a plurality of search key word tables corresponding to the plurality of stages.

Abstract: Methods, computer systems, and computer-readable storage media for utilizing breadcrumb information associated with a Web page to improve a user's search experience on a search engine page and to improve ranking of search results are provided. Breadcrumb information is identified for a plurality of Web pages and is used to create an entity data structure. The entity data structure is used to determine related search items, deep links, and query suggestions on a search engine page. Further, contextual relationships between different breadcrumb elements that are part of a breadcrumb trail associated with a Web page are identified and used to adjust a ranking order of the Web page on a search engine results page.

Abstract: An apparatus, system, and method are disclosed for modifying data set names. A communication module receives a data set name as an index of a catalog entry for a catalog. The data set name comprises at least two qualifiers. A modification module modifies at least one data set name qualifier using a naming algorithm, wherein an alias qualifier is not modified. A store module stores the catalog entry indexed with the modified data set name in order to optimize the location of that entry within the catalog.

Abstract: A method and analytics tools for locating experts with specific sets of expertise are disclosed, the method including providing a collection of documents P0; generating categories representing fields of expertise derived from the collection of documents P0; refining the taxonomy of the categories by applying user domain knowledge; extracting structured fields from the collection of documents P0; constructing a contingency table having a first axis defined by the extracted structured fields and a second axis defined by the categories; and using the contingency table to identify a set of experts having a related expertise. The method may also include a network graph analysis that aids visualization of the relationship between people and expertise.

Abstract: A horizontal anomaly detection method includes receiving at plurality of objects described in a plurality of information sources, wherein each individual information source captures a plurality of similarity relationships between the objects, combining the information sources to determine a similarity matrix whose entries represent quantitative scores of similarity between pairs of the objects, and identifying at least one horizontal anomaly of the objects within the similarity matrix, wherein the horizontal anomalies are anomalous relationships across the plurality of information sources.

Abstract: Example apparatus, methods, and computers support data de-duplication indexing. One example apparatus includes a processor, a memory, and an interface to connect the processor, memory, and a set of logics. The set of logics includes an establishment logic to instantiate one-to-many de-duplication data structures, a manipulation logic to update the de-dupe data structure(s), a key logic to generate a key from a block of data to be de-duplicated, and a similarity logic to make a similarity determination for the block. The similarity determination identifies the block as a unique block, a duplicate block, or a block that meets a similarity threshold with respect to a stored de-duplicated block accessible through the dedupe data structure. The similarity determination involves comparing the block to be de-duplicated to a stored block available to the apparatus using a byte-by-byte approach, a hash approach, a delta hash approach and/or a sampling sequence approach.

Abstract: In one embodiment, a method of conducting operations for a social network application comprises: operating at least one social network application server for interacting with users of the social network application; maintaining user accounts for users of the social network application, the user accounts including data defining relationships between users of the social network application; logging activities of users, the logged activities including real-world activities other than direct use of the social network application; generating a notification list of recent activities of users of the social network application, wherein the notification list includes (1) at least one real-world activity of a first user of the social network application and (2) at least one hyperlink to offer for an activity that is directly related to the at least one real-world activity of the first user.

Abstract: Method and apparatus for monitoring and maintaining group health and membership in a searchable data service. The searchable data service may provide a searchable index to a backend data store, and an interface to build and query the searchable index, that enables client applications to search for and retrieve locators for stored entities in the backend data store. Embodiments of the searchable data service may implement a group health mechanism that may allow one or more components of the searchable data service to identify sets of nodes that the components may monitor. A group health component may be queried by the other components for automatically-refreshed health information about those nodes. The group health component may perform as a node failure detection mechanism. Node health information may be communicated among nodes at least in part using a gossip protocol.