Abstract: Web-based email methods and systems for downloading emails from an email service provider's servers to a user's local system and/or other local storage medium are provided. The user can select the emails to download and the systems and methods can retrieve the selected emails from storage. The text of the emails can be reformatted into a text file. The systems and methods can present a web page to the user from which the email text file can be downloaded. The web page can include attachments to the emails. The text files can be concatenated into a one or more text files and the attachments can be compressed into one or more files. Optionally, the text file(s) and the compressed file(s) can be emailed to an alternate email address. Optionally, the email text and attachments can be formatted for viewing by a local email client.

Abstract: A method and apparatus for generating search results including searching by subdomain and providing sponsored results by subdomain is provided. A search system according to embodiments of the present invention analyzes search queries to determine if they are to be routed to subdomains and presents results include sponsored hits sponsored on a subdomain by subdomain basis.

Abstract: A location beacon database and server, method of building location beacon database, and location based service using same. Wi-Fi access points are located in a target geographical area to build a reference database of locations of Wi-Fi access points. At least one vehicle is deployed including at least one scanning device having a GPS device and a Wi-Fi radio device and including a Wi-Fi antenna system. The target area is traversed in a programmatic route to reduce arterial bias. The programmatic route includes substantially all drivable streets in the target geographical area and solves an Eulerian cycle problem of a graph represented by said drivable streets. While traversing the target area, Wi-Fi identity information and GPS location information is detected. The location information is used to reverse triangulate the position of the detected Wi-Fi access point; and the position of the detected access point is recorded in a reference database.

Abstract: An adaptive, interactive visual workspace for viewing groups of files based on their relationships. Relationships of files are visualized using iterative refinement of categories through a direct-manipulation graph-based layout. The visual workspace starts with a fully connected graph linking thumbnail images of related files that is then partitioned into neighborhoods in response to a user creating file stacks corresponding to different categories. Normalized spring lengths improve the overall quality of the layout. Different modes for membership in neighborhoods avoid confusing motion of files and help a user to manually organize the workspace. Additionally, retrieved files can be added without having to significantly move the previous files. Different visualization techniques indicate which files are related to each other. Different zoom rates are used for file location, and surrogate sizes allow users to increase the separation between files while still increasing the surrogate sizes.

Abstract: Key conditioning involves the construction of a byte orderable array from values for a possibly multi-field key concatenated key, for comparison by a sort routine. Byte-orderable sort keys are conditioned prior to execution of a sort routine, to facilitate an accurate and/or efficient sort procedure. Key conditioning may be applied to values in one or more columns of a database table, where the column(s) are used as keys for sorting rows of the table. Six factors are considered in encoding the byte array, such as whether nulls compare high or low; whether a field is fixed width or variable width; whether a field is guaranteed to be not null; whether a field is ordered ascending or descending; whether a field is the last field of a multi-field sort key or the only field of a sort key; and whether a field is likely to contain a significant number of zero values.

Abstract: Systems and methods for providing automated computer support are described herein. One described method comprises receiving a plurality of snapshots from a plurality of computers, storing the plurality of snapshots in a data store, and creating an adaptive reference model based at least in part on the plurality of snapshots. The described method further comprises comparing at least one of the plurality of snapshots to the adaptive reference model, and identifying at least one anomaly based on the comparison.

Abstract: An apparatus, and corresponding method, for performing a search for a match of at least one expression in an input stream is presented. A graph including a number of interconnected nodes is generated. A compiler may assign at least one starting node and at least one ending node. The starting node includes a location table with node position information of an ending node and a sub-string value associated with the ending node. Using the node position information and a string comparison function, intermediate nodes located between the starting and ending nodes may be bypassed. The node bypassing may reduce the number of memory accesses required to read the graph.

Abstract: Apparatus, systems, and methods may operate to receive a designation of multiple rows to supply data to a single user defined function, which is made available in a structured query language SELECT statement. Further activities may include retrieving the data from at least one storage medium, packing each of the multiple rows having a common key into a single row, and transforming the data from a first state into a second state by applying the single function to the data using a single access module processor. Other apparatus, systems, and methods are disclosed.

Abstract: Methods, systems, and apparatus, including computer program products, for ranking search results for queries. The method includes calculating a visual similarity score for one or more pairs of images in a plurality of images based on visual features of images in each of the one or more pairs; building a graph of images by linking each of one or more images in the plurality of images to one or more nearest neighbor images based on the visual similarity scores; associating a respective score with each of one or more images in the graph based on data indicative of user behavior relative to the image as a search result for a query; and determining a new score for each of one or more images in the graph based on the respective score of the image, and the respective scores of one or more nearest neighbors to the image.

Abstract: Methods, systems and computer program products for inferring a value of a visitor property for a visitor to a web destination are described. A set of traversals indicating visits to web destinations are received, including scored and unscored traversals. Initial destination scores for the web destinations visited by the scored traversals are inferred based on the known scores of the scored traversals. Initial scores for the unscored traversals are estimated based on the initial destinations scores. Revised destination scores for the web destinations visited by the scored traversals and initial destination scores for the web destinations only visited by the unscored traversals are inferred. Revised scores for the unscored traversals are estimated based on the revised destination scores and initial destination scores. Revised destination scores for all of the web destinations are inferred based on the scores of the scored traversals and the revised scores of the unscored traversals.

Abstract: An approach for building an ontology is provided. Based on a grammar, extracted complex triples are syntactically transformed to identify core terms. The syntactically transformed complex triples are semantically transformed into simplified triples referring to new terms that conceptualize the core adjectives, adverbs and verbs, and assigning the core terms to respective definitions and keys in a reference ontology, thereby retaining the semantics of the complex triples. Based on a meta-schema of the reference ontology, an enrichment transformation of the simplified triples is performed to create simplified and enriched triples by adding relations derived from a correspondence each term in the simplified triples has with the reference ontology and by adding representations of semantics of reference ontology definitions of the terms. The simplified and enriched triples are stored as an ontology representing knowledge in an application providing the free-form text from which the complex triples were extracted.

Abstract: User-generated tags from viewing web-based content are collected over a predetermined period of time. A subset of distinct or unique tags is identified from among the collected tags. A z-score is calculated for each identified distinct tag, where the z-score is a measure of the statistical significance of the tag. The subset of distinct tags is then sorted based on their corresponding z-score. All distinct tags having a corresponding z-score lower than a predetermined threshold are rejected and the remaining distinct tags, having a corresponding z-score higher than the threshold are used to infer a user's interest. The ability to infer a user's interests from the remaining distinct tags may thus benefit web-based applications by achieving a high degree of accuracy in predicting the interests of users by leveraging on the use of the user generated content tags and keywords.

Abstract: A method of managing a domain, a method of extending a domain, and a method of selecting a reference point controller are provided. The method of operating the domain includes: receiving a request for authenticating a reference point controller from a reference point controller candidate; invalidating a membership of the stored reference point controller; generating a unique reference point controller membership for verifying that the reference point controller candidate is a new reference point controller; and transmitting the generated reference point controller membership to the reference point controller candidate. Accordingly, even when an error occurs in the reference point controller, the function of the reference point controller can be rapidly replaced by using the reference point controller candidate.

Abstract: A computer implemented method for matching video data to a database containing a plurality of video fingerprints of the type described above, comprising the steps of calculating at least one fingerprint representing at least one query frame from the video data; indexing into the database using the at least one calculated fingerprint to find a set of candidate fingerprints; applying a score to each of the candidate fingerprints; selecting a subset of candidate fingerprints as proposed frames by rank ordering the candidate fingerprints; and attempting to match at least one fingerprint of at least one proposed frame.

Abstract: An application management system, including a learning robot/learning agent adapted to generate control data (eg automation script) by monitoring interactions (404,406) between a customer service application (CSA) and a user of the application and an execution robot for sending application data to the application on the basis of the control data, is described. A contact center management system whose components are configurable by a contact center administrator is also described. A relationship management system that manages a relationship between a business requiring a contact center and a customer service representative broker is also described.

Abstract: A method, system, and computer program product for intelligent command prediction are provided. The method includes determining a command prediction preference associated with a user from user profile data, and selecting one or more command history repositories responsive to the command prediction preference. The one or more command history repositories include command history data collected from a plurality of users and classification data associated with the plurality of users. The method also includes calculating command probabilities for commands in the command history data of the selected one or more command history repositories as a function of the classification data associated with the plurality of users in relation to the user. The method additionally includes presenting a next suggested command as a command from the command history data of the selected one or more command history repositories with a highest calculated command probability.

Abstract: The present invention provides a method and system of receiving data in a data store in a server computer system. In an exemplary embodiment, the method and system include (1) receiving client authentication information of a client computer system, (2) receiving a data signature of the data from the client computer system, and (3) attempting to locate in the data store at least one data chunk with a stored data signature equal to the received data signature.

Abstract: A method and system for web mining and clustering is described. The method includes receiving and dividing input data into a plurality of primitive datasets. Additionally, one or more combinations of the plurality of primitive datasets may be created. Further, a model for each primitive dataset in the plurality of primitive datasets and each of the one or more combinations of the plurality of primitive datasets may be generated. Subsequently, a cost associated with a model corresponding to each primitive dataset in the plurality of primitive datasets, and each of the one or more combinations of the plurality of primitive datasets may be computed. Further, a sum of the costs associated with the models corresponding to each primitive dataset in the plurality of primitive datasets may be compared with the cost associated with each model corresponding to each of the one or more combinations of the plurality of primitive datasets.

Abstract: A computer implemented method computer implemented method for deriving a fingerprint from video data is disclosed, comprising the steps of receiving a plurality of frames from the video data; selecting at least one key frame from the plurality of frames, the at least one key frame being selected from two consecutive frames of the plurality of frames that exhibiting a maximal cumulative difference in at least one spatial feature of the two consecutive frames; detecting at least one 3D spatio-temporal feature within the at least one key frame; and encoding a spatio-temporal fingerprint based on mean luminance of the at least one 3D spatio-temporal feature. The least one spatial feature can be intensity. The at least one 3D spatio-temporal feature can be at least one Maximally Stable Volume (MSV).

Abstract: A method accomplishes matching a particular media metadata record to one of a plurality of records of a first media metadata database. For the particular media metadata record, for each of at least some of the tokens of the particular media metadata record, a table is processed that correlates that token to records of the first media metadata database. Based on the processing, it is determined in which of the plurality of records (match candidate records) of the first media metadata database that token of the particular record appears. For each of at least some of the match candidate records of the first media metadata database, a value is determined that indicates a degree of match between that match candidate record and the particular media metadata record. The determined values are processed to determine one of the match candidate records is a nominal match to the particular media metadata record.

Abstract: Some embodiments, among others, include a search for sensitive information. Once a result of the search has been obtained, a score is assigned to the obtained result in accordance with a predefined criterion.

Abstract: A method and system for automatically generating regular expressions for relaxed matching of text patterns. A received input phrase expressed in a natural language is determined to be a plain text pattern. The plain text pattern is automatically tokenized, thereby generating a first token list. Rules loaded from a predefined rule set are automatically applied to the first token list to automatically generate a modified token list. The order of the rules being applied to the first token list is specified by the rule set. The modified token list is automatically converted into a regular expression that matches the plain text pattern and one or more variations of the plain text pattern. A utilization of the regular expression for an information extraction facilitates a recall and a precision of the information extraction.

Abstract: Determining sequences of queries for retrieving images of negotiable instruments such as checks. A request for a check image is received from a first computer such as an account holder computer at a second, intermediate computer that hosts an on-line banking program and is in communication with a third computer of a financial institution. A sequence program is executed to determine a first sequence of queries having respective query formats available to attempt to retrieve the requested image from an image server or data store. The first sequence is determined based on historical data of whether respective query formats were successfully used in the past to retrieve respective requested images from the data store and is dynamically updated to reflect whether queries were used to retrieve requested images. Thus, with embodiments, the order of queries to utilize is dynamic and can change as opposed to being pre-determined or static.

Abstract: An embodiment of the invention, directed to assessing quality of recorded service data, comprises the step of receiving a record containing service data at a service record evaluator. The method further comprises selecting at least one information field of a plurality of information fields contained in the received record, and determining a numerical quality score for each selected information field. Each of the quality scores is used to compute a cumulative quality score for the record, and it is determined whether the cumulative quality score is no less than a minimum quality threshold.

Abstract: Participants in a communication are rendered by determining whether each entry in a list of participants in the communication satisfies criteria specified by a user participating in the communication. The criteria are used to identify a first subset of participants that is to be rendered in a first style that differentiates the first subset from remaining participants in the list. The first subset of participants is formatted in the first style.

Abstract: Business, recommendation, and social relationship graph information for businesses may be received from a data source social networking website, where each business is recommended by users. The recommendation information may indicate users that recommend certain businesses. The social relationship graph information may indicate user-specific networks of social relationships on the social networking website. For a user query including business and affinity group selection criteria, business, recommendation, and social relationship graph information may be searched to select businesses that: match the business selection criteria; and are recommended by users having social relationships within a maximum degree of closeness with the querying user and being in an affinity group matching the affinity group selection criteria. The selected businesses may be ranked based on numbers of recommending users and social relationship graph information.

Abstract: Methods, systems and articles of manufacture are provided to facilitate efficient searching and reconstruction of entity relationship data in a relational database. The entity relationship data in the relational database is migrated from an object oriented program environment.

Abstract: A method, system, and computer program for enabling parametric searches on source data using text search engine. The invention is generally divided into a build-time process and a run-time process. During the build-time process, a crawler extracts data units from source data. A data translator then translates data units into keyword parametric entries that are submitted to the text search engine. During the run-time process, a query translator translates parametric search queries into keyword search entries. A metatag refiner then filters intermediate search results from the search engine based on the parametric search query.

Abstract: An apparatus having a content-addressable memory (CAM) that stores a plurality of entries comprising portions of a plurality of patterns; a memory that stores a shift value corresponding to each of the entries; and a controller that generates a first key based on a received string, applies the first key to the CAM to select an entry of the CAM, retrieves the shift value from the memory corresponding to the selected entry, in response to the shift value being equal to a predetermined value, identifies an initial match, and in response to the initial match corresponding to a first pattern of the plurality of patterns that is larger than the entries of the CAM, applies adjacent keys based on the received string to the CAM, and declares a complete match when each of the corresponding shift values from the memory is equal to the predetermined value.

Abstract: Participants in a communication are rendered by determining whether each entry in a list of participants in the communication satisfies criteria specified by a user participating in the communication. The criteria are used to identify a first subset of participants that are to be rendered in a first style that differentiates the first subset from remaining participants in the list. The first subset of participants is formatted in the first style.

Abstract: A method for compressing and decompressing files is provided. The method includes creating a list of shift-invariant focal points of neighborhoods in the stream and comparing those focal points to a list of focal points created using the same method on the reference stream. The method of the present invention searches for the longest sequence of focal points that appear in both files. The method of the present invention also verifies that neighborhoods contain the same focal points. The changed data and references to the reference stream are then encoded. The decompression process decodes the encoded stream of data, and using the reference stream recreates the new version of stream.

Abstract: A request is received from a client machine via a web interface for content presented on a web page. A globally unique identifier (GUID) that is associated with the user is accessed and a number is generated based on the GUID. The generated number is utilized as an index to locate the storage device from the number of storage devices. Here, the storage device stores a user profile associated with the user. The user profile is read from the located storage device and the web page is personalized based on this user profile. The personalized web page is then communicated to the client machine. Other techniques for locating a storage device are also described.

Abstract: A look up engine 200 comprising a storage means 212a, 212b for storing a plurality of entries, each entry comprising a value and an associated key value, such that, in operation, a look up is carried out by outputing a value which is associated with the stored key value which matches an input key value. The look up engine 200 comprises a plurality of look up state machines 206a, 206b, 206c, 206d connected in parallel to enable multiple look ups to be carried out concurrently. Each entry comprises an associated skip value, if the skipped bits of the input key value and the associated skip value mismatches, an error message is output to indicate lookup failure. The entries may be stored in a trie format which is constructed by identifying overlapping ranges between the plurality of entries; splitting the identified overlapping ranges; storing the plurality of entries within a trie structure.

Abstract: Prefixes are registered on a first list as index elements for respective registration patterns. Each prefix is selected as the longest of different-length prefixes that are extractable from a registration pattern in accordance with an extraction rule. Suffixes, which are the remaining parts of the registration patterns excluding the respective prefixes, are registered on a second list. Using different-length prefixes that are extracted from a retrieval key in accordance with the extraction rule, a prefix retriever searches the first list to retrieve a registration pattern whose prefix matches any of the prefixes of the retrieval key. A suffix checker carries out a check on the suffix of the registration pattern retrieved by the prefix retriever, among the suffixes on the second list, as to whether the suffix of the registration pattern matches the suffix of the retrieval key.

Abstract: Computer-readable media, systems, and methods for flexible matching with combinational similarity are described. In embodiments, an object image is received, a query image is received, and the query image is compared with the object image. In various embodiments matching information is determined based upon combinational similarity and the matching information is presented to a user. In various embodiments, comparing the query image with the object image includes dividing the object image into agents, creating a gradient histogram for the agents, determining map areas for the query image, creating a gradient histogram for the map areas, and creating a similarity array for each of the agents. Further, in various embodiments, determining matching information includes creating a combinational array by combining the similarity arrays for each agent and determining whether the combinational array includes a peak value.

Abstract: A communication device management program that enables efficient use of memory space in receiving data using remote direct memory access (RDMA) techniques. The receiving node transmits a virtual ID corresponding to a receiving process to a remote sending node. A sending process in the sending node specifies this virtual ID when starting data transmission. If the receiving node has not reserved a memory area corresponding to that virtual ID, the sending node transmits a reservation request to the receiving node, which causes a data receiving memory area to be reserved for use by a communication device in the receiving node. In the sending node, the sending communication device begins sending transmission data in RDMA mode, from a memory area managed by the sending process to the reserved data receiving memory area. The receiving communication device directs incoming transmission data to a memory area managed by the receiving process.

Abstract: A search engine provides personalized rankings of search results. A user interest profile identifies topics of interest to a user. Each topic is associated with one or more sites, and a boost value, which can be used to augment an information retrieval score of any document from the site. Search results from any search are provided to the user, with a variable control of the ranking of the results. The results can be ranked by their unboosted information retrieval score, thus reflecting no personalization, or by their fully or partially boosted information retrieval scores. This allows the user to selectively control how their interests affect the ranking of the documents.

Abstract: One aspect of the present invention includes an optimized simultaneous storage operation for data objects onto a combination of deduplicated and non-deduplicated storage pools. In one embodiment, a data object is provided for storage onto destination storage pools in a storage management system, and placed into a source buffer. The data object is first divided into data chunks if the data object has not previously been chunked within the storage management system. The data object is then simultaneously copied from the source buffer to each destination storage pool (deduplicating and non-deduplicating) with the following operation. If the destination pool utilizes deduplication, then the individual data chunks are only transferred if copies of the individual data chunks do not already exist on the destination storage pool. If the destination pool does not utilize deduplication, then all chunks of the data object are transferred to the destination storage pool.

Abstract: A system and method for collecting entity aliases include a web object collection component that obtains, from a web search engine, at least one Web object associated with a user' input entity. The system and method also include a social tag collection component that obtains a respective set of social tags for each of the Web objects from a social tag website and defines candidate aliases for the user's input entity based upon the respective set of social tags. An aliases refinement component refines the candidate aliases to obtain a collection of aliases of the user's input entity.

Abstract: System, method and computer program for initiating a search at a server computer. A data base including a URL of the server computer is stored at a client computer. Information entered by a user into the client computer is received. From the information, a search term and the URL of the server computer are identified. Then, an HTTP search request which includes the URL of the server computer and the search term is generated. Then, the HTTP search request is sent to the server computer. The identifying of the URL of the server computer comprises searching the data base for a character string contained in the information that matches the URL of the server computer. The identifying of the search term comprises identifying a portion of the information appended to the URL of the server. The identifying of the search term also comprises omitting from the portion one or more symbols adjacent to the search term which are inconsistent with a search request using HTTP.

Abstract: A database management protocol exchanges update tokens between a client and a server on which the database resides. When a client requests data to be read from a database, an update manager either reads an update token stored therein or generates one dynamically. The update token represents a current state of the data object being read. Sometime thereafter, if the client requests new data to be stored in the object, the client may furnish the update token back to the update manager. The update manager compares the client's update token to a local update token representing a current state of the database and, if they match, determines that the state has not changed. If they do not match, an error results.

Abstract: Data records containing one or more fields, which can be considered keys and/or values, are received, and processed such that data values of records that contain key values of interest are aggregated together. The keys of the resultant aggregations or “resultant keys” are created under the control of simple parameters to an aggregation framework. Similarly, the particular aggregations performed are also under the control of a similar set of simple parameters to the aggregation framework. Mapping of keys to reduce originality is one of the important features of resultant key creation. Finally, the structure of the parameters used to control aggregation is simple, flexible, and powerful.

Abstract: Prefixes are registered on a first list as index elements for respective registration patterns. Each prefix is selected as the longest of different-length prefixes that are extractable from a registration pattern in accordance with an extraction rule. Suffixes, which are the remaining parts of the registration patterns excluding the respective prefixes, are registered on a second list. Using different-length prefixes that are extracted from a retrieval key in accordance with the extraction rule, a prefix retriever searches the first list to retrieve a registration pattern whose prefix matches any of the prefixes of the retrieval key. A suffix checker carries out a check on the suffix of the registration pattern retrieved by the prefix retriever, among the suffixes on the second list, as to whether the suffix of the registration pattern matches the suffix of the retrieval key.

Abstract: A system for identifying keywords in search results includes a plurality of neurons connected as a neural network, the neurons being associated with words and documents. An activity regulator regulates a minimum and/or maximum number of neurons of the neural network that are excited at any given time. Means for displaying the neurons to a user and identifying the neurons that correspond to keywords can be provided. Means for changing positions of the neurons relative to each other based on input from the user can be provided. The change in position of one neuron changes the keywords. The input from the user can be dragging a neuron on a display device, or changing a relevance of two neurons relative to each other. The neural network can be excited by a query that comprises words selected by a user. The neural network can be a bidirectional network. The user can inhibit neurons of the neural network by indicating irrelevance of a document.

Abstract: A data correction apparatus, a data correction method and a tangible machine-readable medium thereof are provided. The data correction method comprises the following steps: receiving a plurality of packets; determining that all of the packets are erroneous packets according to cyclic redundancy check (CRC) information thereof; retrieving any number of pairs among the packets to proceed an exclusive-OR (XOR) logical calculation to generate a plurality of error patterns; obtaining an overall error pattern according to an OR logical calculation of the error patterns; and calculating a correct packet according to one or more of the packets and the overall error pattern.

Abstract: Systems and method are disclosed for applying a query to an event stream by storing one or more event constraints; performing constraint aware complex event processing on the query and the event constraints; and optimizing the query at run time.

Abstract: Generating reference structural patterns representing hierarchized data, by extracting primary structural patterns. Each primary structural pattern represents a set of pieces of structural information. The degree of use of extracted primary structural patterns is determined based on of the number of hierarchized pieces of data able to be represented by the primary structural patterns. Primary structural patterns are grouped based on the degree of use and a distance between primary structural patterns. One reference structural pattern per group is determined, the reference structural pattern representing the primary structural patterns of the associated group.

Abstract: An apparatus for retrieving a structured document including a first specifying unit that specifies a plurality of object documents from a plurality of structured documents being accessible via a network, the object document being the structured document according to retrieval condition; a first extracting unit that extracts text included in the object document; a second extracting unit that extracts metadata appended to the object document, the metadata being first data concerning the text of the object document and second data indicating a link relation between the object document and the structured documents; and a first calculating unit that calculates importance of each of the object documents, based on the text and the metadata of each of the object documents.

Abstract: A method for determining e-mail address formatting rules corresponding to particular domain names, whereby e-mail address data is collected and sorted based on domains. Based on the gathered data for particular domains, a pattern is identified and an e-mail address formatting rule is determined. Format rule information is stored for future use to assist in correcting and directing e-mail messages so that they may be received by their intended recipients. Gathering of e-mail address data occurs by directly gathering e-mail addresses and e-mail address format data directly from entities responsible for the domain or format are derived based on patterns observed in collected address data for particular domains. Data for developing these patterns may be gathered from e-mail address information resident on the Internet, e-mail address information from e-mail address books, or from public e-mail address listings.

Abstract: The present invention provides an image and video indexing scheme for content analysis. According to the invention, a database of images or videos is compressed. By examining patterns in the compression scheme of each image or video, the present invention identifies the content of the data. In one embodiment, an unsupervised learning method is employed where each image or video is sub-divided into smaller blocks (8 pixels×8 pixels, for instance) and each of the smaller blocks is examined for its compression pattern. Then, the patterns associated with each of the smaller blocks is recorded for each of the images in the database and content is retrieved from the database by associating certain patterns or groups of patterns with certain content.