Abstract: A system and method for summarizing a multiuser communication session is disclosed. A processing unit receives data about the multiuser communication session. A session management module manages the multiuser communication session. A feature extraction module extracts features from the data. An analyzing module analyzes the features to identify segments of interest for the multiuser communication session including a beginning and an end of each segment of interest and a list of participants in each segment of interest. A summarizing engine generates a summary for the multiuser communication session including at least one segment of interest.

Abstract: A method, system, and computer program product to create an access control bit mapping (ACBM) structure for a corresponding database table are disclosed. The ACBM structure may include a relative record number (RRN) bit map. The RRN bit map may describe the access rights for a parameter. The computer-implemented method may maintain one or more statistics describing the RRN bit map. The method may additionally provide for updating the ACBM structure. The method may also provide for using the ACBM structure to process a database query.

Abstract: Methods and systems for accessing documents in document collections using predictive word sequences are disclosed. A method for accessing documents using predictive word sequences include creating a candidate list of word sequences where respective ones of the word sequences comprise one or more elements derived from the document corpus; expanding the candidate list by adding one or more new word sequences, where each new pattern is created by combining one or more elements derived from the document corpus with one of the word sequences currently in the candidate list; determining a predictive power with respect to the subject for respective ones of entries of the candidate list, where the entries include the word sequences and the new word sequences; pruning from the candidate list ones of said entries with the determined predictive power less than a predetermined threshold; and accessing documents from the document corpus based on the pruned candidate list.

Abstract: Methods, computer systems, and computer-storage medium for generating a per-document index used for semantic searching is provided. A document is received and parsed into a plurality of section. Each term in each section is translated in order to at least one of a cache index or a term identifier. Subsequent to translating the terms, each section is separately group encoded to generate the per-document index. The per-document index is stored in association with a data store.

Abstract: A system includes reception of an instruction to access a column of a database table, determination that the column is not associated with the schema of the database table, determination of whether the schema of the database table is flexible or static, returning, if it is determined that the schema of the database table is static, of an error in response to the instruction, and, if it is determined that the schema of the database table is flexible, not returning an error in response to the instruction.

Abstract: A geographic database is defined using hierarchical data trees and updated by changing selected portions of a data tree. A device defines a binary large object (BLOB) including map data as a first data tree and an update to the map data as a second data tree. The device computes a difference between the first data tree and the second data tree. The difference may include the data and links that are being updated. The device generates an update script including a sequence of edit operations needed to update the map data. The device may communicate the update script to a navigation device, which is configured to execute the update script to perform the update on a local version of the map data.

Abstract: A system, method and medium may provide determination of a first plurality of a plurality of data records assigned to a first processing unit, identification of a first record of the first plurality of data records, the first record associated with a first key value, generation of a first dictionary entry of a first dictionary for the first key value, storage of a first identifier of the first record as a tail identifier and as a head identifier in the first dictionary entry, storage an end flag in a first shared memory location, the first shared memory location associated with the first record, identification of a second record of the first plurality of data records, the second record associated with the first key value, replacement of the tail identifier in the first dictionary entry with a second identifier of the second record, and storage of the first identifier in a second shared memory location, the second shared memory location associated with the second record.

Abstract: A global-level manager receives a work order referencing at least one executable file and one or more input files. The one or more input files include multiple input resources. A first type of input resource is identified in the one or more input files and a second type of input resource in the one or more input files. The first type of input resource is split into a plurality of first-type input shards. The second type of input resource is split into a plurality of second-type input shards. The plurality of second-type input shards are associated with each of the first-type input shards. For each of the first-type input shards, the global-level manager distributes the first-type input shards, the associated second-type input shards, and the executable file to a single.

Abstract: Methods and apparatus are presented for aggregating data from disparate sources into an efficiently accessible format. For example, an aggregation tool may receive attribute-based data from one source and metrics-based data from another source. Given this data, the aggregation tool may store attribute data from the attribute-based data into a data object, where the data object includes multiple time slots corresponding to defined time ranges. The aggregation tool may then determine from the metrics-based data, respective metrics data for each of the multiple time slots of the data object, where each time slot is associated with the attribute data. The aggregation tool may store the respective metrics data into each of the multiple time slots of the data object. In this way, the data object may serve to efficiently provide an answer to a query requiring data from multiple data sources.

Abstract: To provide a method, program, and system for converting graph data to a data structure that enables manipulations in various applications to be reflected in the original graph data. The method uses at least one graph matching pattern to convert at least a part of graph data including nodes and edges to a data structure as an image of a homomorphism thereof. A pattern is provided which includes one representative node variable having a first constraint that at most one node in the graph data matches the representative node variable; the node is prohibited from matching a node variable in another pattern. The method includes the step of performing matching between the graph data and the pattern to obtain a matching result that does not violate constraints including the first constraint, and the step of generating a data structure corresponding to the matching result that does not violate the constraints.

Abstract: A storage system that may include a management module, a communication module and a storage module; wherein the management module is arranged to receive, at an intermediate point in time that occurs between the first point in time and a second point in time, a first request that indicates that a certain extent of the second logical volume is irrelevant; participate in a creation of second point in time snapshots of the first and second logical volumes; select, in response to the first request, out of all data deltas generated between the first and second point in time, selected data deltas to be transmitted to the other storage system; wherein the selected data deltas exclude data deltas associated with the certain extent that were generated between the first point in time and the intermediate point in time.

Abstract: Texts may be classified by mapping the texts to concept space, and by dividing the concept space based on substantive classes. A concept space containing a diverse set of concepts is defined. One example of a concept space is the set of on-line encyclopedia articles, each of which is an example of a concept. A text is scored for relevance against each concept, and a vector is created containing each of the scores. The vector represents the text's position in concept space. For any given substantive class of texts, the concept space may be divided into regions containing texts that are members/non-members of the class. The dividing boundary may be determined by training a classifier on a set of labeled examples of texts that fall inside and outside the class.

Abstract: A method and system for central data querying are provided. A user parameter requesting data is retrieved. A device is determined based upon the user parameter. A query is generated based upon the user parameter. The query is executed in the device to extract the data.

Abstract: Redirection of user entered data to an unauthenticated website (“phishing”) is checked by, at redirection, detecting the presence of data entry fields in a user web page and, if any are present, authenticating the redirection address against lists of approved websites or the redirection web site certificate. If the new address is not authenticated, the user may still opt to be redirected.

Abstract: A system, method and computer-readable medium provides steps of merging one or more sources of IP addresses to create a merged database comprising a plurality of IP zones, user typing each of the plurality of IP zones, enhancing each of the plurality of IP zones, receiving an input address and selecting one or more of the plurality of IP zones having a predetermined statistical relationship to the input address.

Abstract: A technique for monitoring software which efficiently communicates transaction trace data, including static and dynamic data, from an agent to a manager is disclosed. A tree data structure describes transactions as a sequence of transaction elements. Each branch may correspond to one type of transaction. The nodes along a branch may be associated with components of monitored software that are invoked to perform the transaction. A provisional branch may be constructed when an agent is unable to initially identify the transaction. Transaction data may be stored in association with the nodes in the provisional branch during the monitoring. After information needed to identify the transaction becomes available to the agent, the provisional branch is updated. The transaction data is reported in response to determining the branch in the tree data structure that matches the provisional branch.

Abstract: Described are embodiments of an invention for prioritizing data items for backup in a computing environment. The computing environment includes a plurality of clients coupled through a network to a backup system for backing up items stored locally on the client. Each client includes a continuous data protection (CDP) module that prioritizes the order of files transmitted to the backup system for storage on one or more storage devices based on policy. The CDP module builds an initial backup list and a CDP backup list. The initial backup list includes any item that meets the criteria of the initial backup profile. The CDP backup list includes items that have been modified since the initial backup process began. The data that is the most critical to a user is often the most recently modified data. Thus, the CDP module preferentially performs a backup of items on the CDP backup list.

Abstract: A system and method for generating a reputation score is disclosed. A processing unit processes user activity data from data sources to identify user interactions associated with a user. A categorizing engine categorizes the user interactions into categories. A social bonus engine determines a social bonus score based on social affinity data. A scoring engine computes a first reputation score for the user by combining scores for the categorized user interactions with a social bonus score. A learning engine receives a second set of user interactions and training data and generates a learning result that is used to update the first reputation score.

Abstract: Disclosed are systems, apparatus, methods, and computer readable media for analyzing computing site information. In one embodiment, an analysis tool for analyzing a first site record stored on a storage medium may be selected. The first site record comprising information may relate to a computing site. The computing site may comprise a unit of computing functionality accessible via a network. When it is determined that first confidentiality level for the computing site exceeds a trust level for the analysis tool, the first site record may be modified to create a second site record, the second site record having a second confidentiality level, the second confidentiality level not exceeding the trust level.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for receiving a first source file, the first source file including one or more first computer-aided design models; converting the first source file into a first plurality of files; generating a first snapshot, the first snapshot including the first source file, the first plurality of files, and a first version; receiving a second source file, the second source file having the first format that is readable by the first application, the second source file including one or more second models, the second source file being an updated version of the first source file; converting the second source file into a second plurality of files; generating a second snapshot; and associating the second snapshot with the first snapshot, where the second snapshot being a more recent version than the first snapshot.