Abstract: A degree of social network separation of a social network user that generated expressive content of a social media posting is identified relative to a specified social network user for each of a group of social media postings. Social media postings with an equivalent identified degree of social network separation relative to the specified social network user are grouped. Differences between the expressive content of the grouped social media postings at different degrees of social network separation are determined. The determined differences between the expressive content of the grouped social media postings at the different degrees of social network separation are rendered.

Abstract: A degree of social network separation of a social network user that generated expressive content of a social media posting is identified relative to a specified social network user for each of a group of social media postings. Social media postings with an equivalent identified degree of social network separation relative to the specified social network user are grouped. Differences between the expressive content of the grouped social media postings at different degrees of social network separation are determined. The determined differences between the expressive content of the grouped social media postings at the different degrees of social network separation are rendered.

Abstract: Embodiments include methods, systems and computer program products for performing a composite sort on a tunable hardware sort engine includes determining desired sort performance parameters, configuring a composite sort engine based on the desired sort performance parameters, and receiving a plurality of keys having a payload associated with each of the plurality of keys. The method also includes reserving DRAM storage for each of the payloads, generating a tag for each of the plurality of keys, the tag identifying the DRAM storage reserved for each of the payloads, and storing the payloads in the portions of the DRAM storage. The method further includes generating a composite key for each of the plurality of keys, sorting the composite keys by the composite sort engine, and retrieving the payloads associated with the sorted composite keys from the DRAM storage. The method also includes outputting the payloads associated the sorted composite keys.

Abstract: Mechanisms are described to extract location information from unstructured text, comprising: building a language model from geo-tagged text; building a classifier for differentiating referred and physical location; given unstructured text, identifying referred location using the language model (that is, the location to which the unstructured text refers); given the unstructured text, identifying if referred location is also the physical location using the classifier; and predicting (that is, performing calculation(s) and/or estimation(s) of degree of confidence) of referred and physical location.

Abstract: A method for storing XML data into a relational database, including the following steps: splitting an XML Schema into one or more mapping configuration files, each mapping configuration file corresponding to a relational database table; parsing an XML text, and according to the associative relationship in the mapping configuration files, inserting the data in the XML text into the multiple relational database tables; and accessing the database to read the data in the XML text. The method stores XML file data into a relational database, and accelerates data reading and access speed.

Abstract: Methods and apparatus are provided for processing data representing three-dimensional points organized in a data structure wherein each point has multiple components, the data is organized in a respective layer per component, each layer is segmented in cells of a two-dimensional grid, the cells are arranged such that the components of a given point are contained in corresponding cells of multiple layers, the cells are grouped in patches by layer, and the patches are arranged such that the components of an array of points is represented by corresponding patches of multiple layers. At least one first criterion and at least one second criterion are obtained. Data are retrieved from cells of patches meeting the at least one first criterion and from layers meeting the at least one second criterion. The retrieved data are processed to obtain a derivative data set.

Abstract: In the present work, quantum clustering is extended to provide a dynamical approach for data clustering using a time-dependent Schrödinger equation. To expedite computations, we can approximate the time-dependent Hamiltonian formalism by a truncated calculation within a set of Gaussian wave-functions (coherent states) centered around the original points. This allows for analytic evaluation of the time evolution of all such states, opening up the possibility of exploration of relationships among data points through observation of varying dynamical-distances among points and convergence of points into clusters. This formalism may be further supplemented by preprocessing, such as dimensional reduction through singular value decomposition and/or feature filtering. Additionally, the parameters of the analysis can be modified in order to improve the efficiency of the dynamic quantum clustering processes.

Abstract: Structured metadata extraction may include accessing one or more documents from which to extract the structured metadata from each of a plurality of hosts. A plurality of entity names can be extracted from the one or more documents from one of the plurality of hosts using an entity name pattern. A first element list can be extracted from the one or more documents based at least in part on the plurality of entity names and based at least in part on one or more heuristic rules. An element list pattern may be generated based at least in part on the first element list, and a second element list may be extracted from the one or more documents based at least in part on the element list pattern.

Abstract: The present technology is related to identifying, from within a corpus of documents, a subject (e.g., person, location, date, etc.) that is relevant to a topic and that is usable to enhance a topic-describing document. Documents within the corpus of documents share a link structure, such that some documents include hyperlinks that enable navigation to the topic-describing document, and the topic-describing document includes hyperlinks that enable navigation to other documents. Text of documents within the corpus is parsed to identify the subject, and a context of the subject suggests a degree of relevance of the subject to the topic. An enhancement type of the subject is determined, and a version of the topic-describing document is enhanced to include a presentation of the subject.

Abstract: Methods, systems, and techniques for managing groups of entities, such as individuals, employees, or systems, and providing entitlement and access to computer resources based on group membership are provided. Example embodiments provide a Group Management System having a Group Management Engine “GME,” an Entitlement Engine, and a Provisioning Engine, which work together to allow simplified grouping of entities and providing entitlement and access to the entities based upon the group membership. In one embodiment, the GME leverages dynamic programming techniques to enable accurate, scalable systems that can manage near real time updates and changes to the group's status or to the entities' status. These components cooperate to enable provisioning of applications based upon current entitlement.

Abstract: Provided is a technique for organizing content objects in an enterprise content management system. Auditing of the content objects is performed to identify one or more content objects that are to be re-classified. A content object is selected. A first category associated with the content object is obtained. A relevancy score is obtained for the first category. A list of candidate categories and relevancy scores for each of the candidate categories are obtained. In response to determining that the first category does not correspond to a candidate category or that the relevancy score does not exceed a threshold, the content object is identified as improperly categorized, and the candidate categories that have associated relevancy scores that exceed the threshold are provided in an audit report.

Abstract: A computer-implemented method may include providing authentication code for an existing web-based application. The authentication code may be programmed to modify functionality of the existing web-based application as the existing web-based application executes while leaving a binary of the existing web-based application unchanged. The method may also include establishing strong authentication for the existing web-based application by 1) identifying, via the authentication code, a request to bind an authentication credential to a profile of a user, the request being received via a browser through which the existing web-based application is accessed, 2) directing, via the authentication code and in response to the request, the browser to an external authentication site that is not part of the existing web-based application, and 3) at the external authentication site, enabling the user to bind the authentication credential to the profile.

Abstract: Provided are a computer implemented method, computer program product, and system for organizing content objects in an enterprise content management system. Auditing of the content objects is performed to identify one or more content objects that are to be re-classified. A content object is selected. A first category associated with the content object is obtained. A relevancy score is obtained for the first category. A list of candidate categories and relevancy scores for each of the candidate categories are obtained. In response to determining that the first category does not correspond to a candidate category or that the relevancy score does not exceed a threshold, the content object is identified as improperly categorized, and the candidate categories that have associated relevancy scores that exceed the threshold are provided in an audit report.

Abstract: There is provided a method to automatically generate software code. The method receives a request for the data, queries at least two data sources for the data based on the request; and receiving results that include the data that is populated to at least one data object.

Abstract: A method and system for improving access to network content are described. Aspects of the disclosure minimize the delay between a navigation event and a network response by prerendering the next navigation event. For example, the method and system may predict a likely next uniform resource locator during web browsing to preemptively request content from the network before the user selects the corresponding link on a web page. The prediction operation may use a current location of a computing device to identify a set of browsing habits associated with that location. The browsing habits may be used to identify a most likely navigation event for prerendering. The methods and systems describe a variety of manners for prerendering content and managing and configuring prerendering operations.

Abstract: A method for storage reclamation in a shared storage device. The method includes executing a distributed computer system having a plurality of file systems accessing storage on a shared storage device, and initiating a reclamation operation by using a reclamation agent that accesses the shared storage device. The method further includes reading the file system data structure that represent unallocated storage blocks of one of the plurality of file systems that will undergo a reclamation operation. A plurality of I/O resources that are used to provide I/O to the unallocated storage blocks are then interrupted. Storage from the unallocated storage blocks is then reclaimed, and normal operation of the I/O resources that are used to provide I/O to the unallocated storage blocks is resumed.

Abstract: Described are systems, media, and methods for discovery of media relevant to a user and sharing the media with the user.

Abstract: A method, apparatus and system for transforming genomic data into a computer database environment comprising a forward lookup table and a plurality of reverse lookup tables which relate consecutive overlapping reference sequence segments to reference sequences stored in the forward lookup table enables rapid and precise matching of undefined biological sequences with reference sequences.

Abstract: A framework for large-scale multi-label classification of an electronic document is described. An example multi-label classification system is configured to identify seed labels that represent respective one or more candidate content topics associated with the electronic document and determine additional labels based on the seed labels and label correlation data derived from member profiles maintained by an on-line social network system. The multi-label classification system then constructs a graph comprising nodes that correspond to the seed labels and the additional labels. A clustering algorithm is applied to the constructed graph to produce a labels graph. The labels graph is deemed to include nodes that correspond to topics discussed or referenced in the electronic document.

Abstract: Aspects of the present invention provide a solution for augmenting managed data. In an embodiment, a data item that is being and/or has been accessed by a user is analyzed to retrieve a set of features. Based on this set of features, the data item is indexed. An analytical analysis is performed on the data item based on the set of features. This analytical analysis can be used to obtain a group of data items that is related to the data item. This group of related data items can be returned to the user, such as when the user reacquires network connectivity.

Abstract: Methods and arrangements for discovering entity types for a set of records. A set of records is input, with each record comprising attributes with associated attribute values. The records are grouped into candidate entity types in view of at least one of: the attribute values of the records, at least one domain ontology and at least one dimension hierarchy. An interestingness measure of each candidate entity type is calculated, via estimating interestingness based on at least one factor selected from the group consisting of: a correlation between attribute values of records, a number of attributes, a log of queries issued to a server, and an average group size for candidate entity types. At least one candidate entity type is validated based on the calculated interestingness measures. Other variants and embodiments are broadly contemplated herein.

Abstract: An embodiment of a POS system according to the present invention stores log information and RAS information into a storage device (11) which stores an operating system, an application program and the like without being equipped with any non-volatile memories for storing the log information and the RAS information, wherein the log information is a record of a process, an operation and the like; and the RAS information is information pertaining to a hardware life-time. The POS device does not need to be equipped with a nonvolatile memory which is different from a storage device to store an operating system (OS), an application program and the like. Nevertheless the POS device is able to retain log information, RAS information and the like.

Abstract: Techniques, including systems are methods, for analyzing data from multiple sources are disclosed and suggested herein. In an embodiment, external information from one or more external information sources and internal information from one or more internal information sources is received. The received external information and internal information are stored in one or more data stores that collectively implement one or more ontologies. One or more conditions are applied to the external information and internal information in the one or more data stores to determine a conclusion and the conclusion is provided to a user.

Abstract: Computer-implemented method, system, and techniques for summarization, searching, and indexing of video are provided, wherein data related to objects detected in the video in a selected time interval is received and the objects are clustered into clusters such that each cluster includes objects that are similar in respect to a selected feature or a combination of features. A video summary is generated based on the computed clusters.

Abstract: Additional content items that satisfy predefined criteria with respect to a user-selected content item are identified. The predefined criteria may be that the selected and additional content items have particular characteristics that are the same. Information corresponding to the selected and identified content items is presented to a user. Characteristics based on which additional content items may be identified may include data type, source, and absence of content. The information may be presented in a gallery view, which can be a thumbnails gallery for images or a playlist for digital audio or video.

Abstract: A technique for identifying overlapping clusters of items in a data set. The technique may be used in connection with a social network or other on-line environment in which users express approval for other users, such as through votes, tags or other inputs. These expressions of approval may be used to form clusters such that entities assigned to a cluster have a higher metric of approval from other entities within the cluster than from outside the cluster. Such clusters may be arrived at through a computationally efficient approach that involves randomly selecting one or more entities as a seed for a cluster. The cluster may be grown by testing other entities, similar to those already in the cluster, to determine whether they are more preferred by those already in the cluster than those outside the cluster. Once a cluster is grown to a desired size, it may be pruned.

Abstract: An information processing device, method and computer program product use a candidate attribute area identification portion configured to receive information associated with a cluster including at least one data item. The candidate attribute area identification portion identifies at least one named attribute area for each of the at least one data item. A relatedness assessment portion assesses a relatedness between the cluster and each of the at least one named attribute area. A cluster name generation portion generates a cluster name based on the assessed relatedness, wherein said cluster name includes at least a part of one of the at least one named attribute area.

Abstract: A device may be configured to identify a plurality of images that are similar to a query image; generate a plurality of sets of rankings of the identified images based on a plurality of image attributes; compare the generated plurality of sets of rankings of the identified images to a reference set of rankings of images; select, based on the comparing, a particular set of rankings; and rank a plurality of images that are associated with another query image, based on an attribute associated with the selected particular set of rankings.

Abstract: A unified framework to understand multimedia signals utilizes the loosely annotated multimedia data on the Web, analysis it in various signal domains, such as text, image, audio and combinations thereof, and builds an association graph called the “Multimedia Brain,” which basically comprises visual signals, audio signals, text phrases and the like that capture a multitude of objects, experiences and their attributes and the links among them that capture similar intent or functional and contextual relationships.

Abstract: Data clustering is provided according to a dynamical framework based on quantum mechanical time evolution of states corresponding to data points. To expedite computations, we can approximate the time-dependent Hamiltonian formalism by a truncated calculation within a set of Gaussian wave-functions (coherent states) centered around the original points. This allows for analytic evaluation of the time evolution of all such states, opening up the possibility of exploration of relationships among data-points through observation of varying dynamical-distances among points and convergence of points into clusters. This formalism may be further supplemented by preprocessing, such as dimensional reduction through singular value decomposition and/or feature filtering.

Abstract: A method for normalizing raw titles to canonical titles is described. The method includes designating a set of canonical titles, generating a set of n-grams for each canonical title, assigning a set of attributes to each n-gram, assigning a set of labels to each of the attributes, and storing the labeled canonical title and labeled n-grams in a database. In some examples, a new title may be mapped to an existing canonical title in the database by generating a set of n-grams for the new title, looking up the n-grams in the database of canonical titles, retrieving the set of labels assigned to n-grams in the database that match n-grams from the new title, and assigning those labels to the corresponding attributes of the new title. The new title may then be mapped to a canonical title on the basis of similarly labeled attributes.

Abstract: A method for determining a cause of events detected in a plurality of interactions includes: identifying, on a processor, a plurality of elements in the interactions; detecting, on the processor, a plurality of sequences of elements in the interactions; mining, on the processor, the plurality of sequences for generating a set of supported patterns; computing, on the processor, association rules from the set of supported patterns; and returning the computed association rules.

Abstract: A method includes: extracting a partial character string including a reserved word and a character string immediately previous or subsequent to the reserved word from each of a plurality of pieces of target data, the plurality of pieces of target data conforming to a first pattern character string including the reserved word defined by a protocol; detecting target data including the partial character string among the plurality of pieces of target data; specifying a first partial character string from the extracted partial character string based on the detected target data; and creating, by a processor, a second pattern character string for classifying the plurality of pieces of target data based on the first pattern character string and the first partial character string.

Abstract: Embodiments relate to retrieving a document from a plurality of document groups in which mutually related documents are each included. An aspect includes acquiring a retrieval condition that includes a plurality of conditions and at least one logical operator that connects the plurality of conditions. Another aspect includes identifying, with respect to each condition of the plurality of conditions, a document group including a document satisfying the condition from among the plurality of document groups. Another aspect includes identifying a document that satisfies at least one condition. Another aspect includes determining a document that is a retrieval result by making a selection to omit or retain that depends on the at least one logical operator. Another aspect includes generating information showing the document that is the retrieval result based on the retrieval condition.

Abstract: A first server is configured to receive one or more summarized data groups from a second server. Each summarized data group may include: information regarding a quantity of a group of records, where the group of records includes records associated with a record type and a time interval; information regarding a quantity of records associated with an indicator within the group of records; and information regarding a failure rate associated with the group of records based on the quantity of records associated with the group of records and the quantity of records associated with the indicator within the group of records. The first server is further configured to determine a threshold based on the summarized data groups and based on the failure rates associated with the summarized data groups and send an indication to the client device based on determining that the failure rate does not satisfy the threshold.

Abstract: Methods and systems are disclosed for anonymizing a dataset that correlates a set of entities with respective attributes. The method comprises determine clusters of similar entities. Determining the clusters comprises (1) partitioning the entities into a first group with similar attributes to one another and a complement group of entities with similar attributes to one another and (2) recursively repeating the partitioning on the groups until every group meets one or more criteria. The partitioning a group comprises choosing a reference entity from the group, determining a symmetric set of attributes based on the reference entity attributes and on an average of the group's attributes, and assigning each entity to the first or second group depending on whether its attributes are more similar to those of the reference user or to those of the symmetric set.

Abstract: Various embodiments are described for searching and retrieving documents based on a natural language input. A computer-implemented natural language processor electronically receives a natural language input phrase from an interface device. The natural language processor attributes a concept to the phrase with the natural language processor. The natural language processor searches a database for a set of documents to identify one or more documents associated with the attributed concept to be included in a response to the natural language input phrase. The natural language processor maintains the concepts during an interactive session with the natural language processor. The natural language processor resolves ambiguous input patterns in the natural language input phrase with the natural language processor. The natural language processor includes a processor, a memory and/or storage component, and an input/output device.

Abstract: Methods and apparatus consistent with the invention provide the ability to organize and build understandings of machine data generated by a variety of information-processing environments. Machine data is a product of information-processing systems (e.g., activity logs, configuration files, messages, database records) and represents the evidence of particular events that have taken place and been recorded in raw data format. In one embodiment, machine data is turned into a machine data web by organizing machine data into events and then linking events together.

Abstract: The invention provides in some aspects methods of digital data processor-based analysis of digital data that represent interactions to identify distinct individuals and/or the entities with which they are affiliated (e.g., households, businesses, social or other groups) involved in those interactions. The methods can be employed, for example, to analyze digital data representing retail purchase, marketing and visitor interactions for tracking and/or reporting purposes.

Abstract: A method for matching bulk data, involving receiving a plurality of input records, performing block distribution on the plurality of input records to obtain a plurality of block records, wherein performing block distribution comprises distributing the plurality of input records to a first plurality of containers, performing concurrent matching operations on the plurality of block records to obtain a plurality of single best records, and loading the plurality of single best records into a master index database.

Abstract: Deterministic Finite Automatons (DFAs) and Nondeterministic Finite Automatons (NFAs) are two typical automatons used in the Network Intrusion Detection System (NIDS). Although they both perform regular expression matching, they have quite different performance and memory usage properties. DFAs provide fast and deterministic matching performance but suffer from the well-known state explosion problem. NFAs are compact, but their matching performance is unpredictable and with no worst case guarantee. A new automaton representation of regular expressions, called Tunable Finite Automaton (TFA), is described. TFAs resolve the DFAs' state explosion problem and the NFAs' unpredictable performance problem. Different from a DFA, which has only one active state, a TFA allows multiple concurrent active states. Thus, the total number of states required by the TFA to track the matching status is much smaller than that required by the DFA.

Abstract: A system for extracting customer feedback from a microblog site includes a retrieval unit coupled to the microblog site to capture microblog updates. A filter unit coupled to the retrieval unit filters the captured microblog updates according to filter criteria that remove non-actionable items from the captured microblog updates. A learning unit coupled to the filter unit prioritizes the filtered microblog updates, and a classification unit coupled to the learning unit classifies the filtered and prioritized microblog updates. An action unit coupled to the classification unit performs appropriate actions based on the classified, filtered and prioritized microblog updates.

Abstract: According to some embodiments, a plurality of source records may be received from a plurality of data sources, with each source record including a plurality of fields. It may be determined that a match group of source records from different data sources relate to the same entity, and a single best record may be automatically created for the match group based on field values from different source records in the match group. The creating may includes, for example, assigning a first set of fields to a first survivorship group associated with a first survivorship rule and a second set of fields to a second survivorship group associated with a second survivorship rule. All records in the match group may then be simultaneously ranked in accordance with the first and second survivorship rules using a single query. The best record could then be stored for subsequent use by other applications.

Abstract: A system provided herein permits a communications network subscriber to establish a local contact database on at least one communications device. The local contact database can communicate with a global contact database to receive contact information updates for a group of subscribers stored within the local contact database. The contact information can include basic contact information, such as name, address, email address, and telephone number. The contact information can also include advanced contact information, such as registration and activity information for each communications device associated with the group of subscribers, location information, hotspot information, points of interest information, and social networking information. Methods are provided herein that permit subscribers to introduce each other and obtain contact information securely. Methods are also provided herein that permit subscribers to request further contact information after a communication session is terminated.

Abstract: An illustrative embodiment of a computer-implemented method for using organizational awareness in locating business intelligence receives an identity of an individual in an organizational hierarchy of users to form an identified individual and identifies people related to the identified individual in the organizational hierarchy of users using a people information database and relationship criteria to form related people. The computer-implemented method further identifies documents associated with the related people to form identified documents, inspects gathered information of the identified documents using a subset of relationship criteria to form inspected information and creates a list of suggested documents based at least on the inspected information.

Abstract: In a database system having processing units, a request is received to calculate aggregates of multiple combinations of a given set of columns. The processing units are divided into multiple groups, where each of the multiple groups includes a corresponding subset of the processing units. Within each of the groups, data of each processing unit in the group is replicated to other one or more processing units in the group. Within each of the groups, aggregates of at least some of the multiple combinations of the given set of columns are calculated by the processing units in the group using the replicated data.

Abstract: Techniques for automatic sort and propagation of information relating to electronic documents are presented. With regard to an electronic document, such as an incoming message, an enhanced information management component (EIMC) can analyze the document to identify a file folder associated with a subject to which the document relates. Based on interaction with or tagging of the document in a first user interface (UI) and predefined user preferences, the EIMC can propagate information relating to the subject and/or document to a second UI. The EIMC can archive the document in the identified file folder automatically or in response to as little as one UI control manipulation. The EIMC can analyze audio or video content to facilitate tagging and archiving of such content using the first UI and propagation of information relating to such content and/or related subject to a second UI.

Abstract: A collation device specifies a combination of event conditions in parallel with each other based on a query. The collation device sets the combination of event conditions in a parallel relation to the same window, connects a plurality of windows in series, and generates a similar query that sets a window interval condition between the windows in a connected relation. The collation device compares a similar query with collation data, and detects a combination of events that satisfies a condition of the similar query from among events included in the collation data.

Abstract: Methods and systems for generating concept structures from signature reduced clusters (SRCs) are provided. The method includes retrieving at least one SRC including a cluster of signatures respective of a plurality of multimedia data elements (MMDEs); generating at least one metadata for each signature of the cluster of signatures; identifying a number of repetitions of a metadata of the at least one generated metadata; and determining whether the number of repetitions of the metadata exceeds a predefined repetition threshold; upon determining that the number of repetitions of the metadata exceeds the predefined repetition threshold, identifying the metadata as representative of the SRC; comparing the representative metadata to metadata that is representative of at least one previously generated SRC to determine a metadata match; and upon determining the metadata match, identifying the retrieved SRC and the matching previously generated SRC as a concept structure.

Abstract: Provided is a process of obtaining a plurality of location data sets from different providers of user geolocation history, each location data set including a plurality of user-activity records, each user-activity records being associated with a user identifier and including geolocations of the corresponding user and times that the corresponding user was at the geolocations, the different providers having different user identifiers for a given corresponding user; matching, by one or more processors, the user identifiers between the location data sets based on geolocations of the corresponding user and times that the corresponding user was at the geolocations; and storing the matched user identifiers in association with one another in corresponding user profiles.