25th week of 2012 patent applcation highlights part 71 |
Patent application number | Title | Published |
20120158661 | CONTEXT-SPECIFIC ROLLBACK - Some embodiments of the invention provide components and/or techniques that may assist in choosing a snapshot to which to roll back to address a system malfunction. For example, some embodiments of the invention may record various metrics describing the system's performance, reliability and/or functionality at the points at which various snapshots are taken, along any of numerous dimensions. When a user later indicates a desire to restore the system to a previous point, these metrics may be analyzed to choose a snapshot to which to roll back. | 2012-06-21 |
20120158662 | BACKUP AND RESTORE OF DATA FROM ANY CLUSTER NODE - Implementing point in time back-up. A method that may be practiced in a distributed computing environment. The distributed computing environment includes a number of computing system nodes. The method includes at a first node in the computing environment, taking a snapshot of a cluster volume. The cluster volume stores data items (e.g. files/blocks). Taking a snapshot includes marking a point in time for data items in the volume. The method further includes receiving a notification that a different node in the computing environment than the first node, has determined to change a data item in the cluster volume at a point after the marked point in time from an old version of the data item to a new version of the data item. The method further includes at the first node, saving the old version of the data item prior to modification. | 2012-06-21 |
20120158663 | NAS SYSTEM AND REMOTE COPY METHOD - The present invention relates to a system that includes one or more logical volumes for storing data; a snapshot producing section for producing snapshots for the logical volumes based on a pre-scheduled snapshot acquisition time; a remote copy section for remote copying difference data for the snapshots based on pre-scheduled remote copy start times; and a scheduling section for re-scheduling the time of one or more of an Nth snapshot acquisition time, an Nth remote copy start time, and an (N+1)th remote copy start time, in such a manner that remote copying starting at the Nth remote copy start time finishes by the (N+1)th remote copy start time. | 2012-06-21 |
20120158664 | RESTORING DATA OBJECTS FROM SEQUENTIAL BACKUP DEVICES - Provided are computer program product, system, and method for restoring deduplicated data objects from sequential backup devices. A server stores data objects of extents having deduplicated data in the at least one sequential backup device. The server receives from a client a request for data objects. The server determines extents stored in the at least one sequential backup device for the requested data objects. The server or client sorts the extents according to an order in which they are stored in the at least one sequential backup device to generate a sort list. The server retrieves the extents from the at least one sequential backup device according to the order in the sort list to access the extents sequentially from the sequential backup device in the order in which they were stored. The server returns the retrieved extents to the client and the client reconstructs the requested data objects from the received extents. | 2012-06-21 |
20120158665 | SYSTEM RESET AND SYSTEM RESTORE - Some embodiments of the invention provide techniques for performing system reset and/or system restore operations. Some embodiments store a record of any changes performed to a data file stored on a virtual hard disk using differencing virtual disks that are captured over time. To restore the file to the state in which it existed at any particular point in time, embodiments of the invention may allow for rolling back the system to a differencing virtual disk captured at or before that time and setting aside blocks of the differencing virtual disk chain captured after that point. To perform a system reset, the system may be rolled back to the parent virtual hard disk, by setting aside all of the blocks of the differencing virtual disk chain. Some embodiments of the invention provide for separating information on the system into a plurality of entities, and maintaining a separate set of differencing virtual disks for each entity. For example, some embodiments may create an entity may be created for each of the operating system, applications and user data, and maintain differencing virtual disks for each over time. | 2012-06-21 |
20120158666 | RESTORING A RESTORE SET OF FILES FROM BACKUP OBJECTS STORED IN SEQUENTIAL BACKUP DEVICES - Provided are a computer program product, system, and method for restoring a restore set of files from backup objects stored in sequential backup devices. Backup objects are stored in at least one sequential backup device. A client initiates a restore request to restore a restore set of data in a volume as of a restore point-in-time. A determination is made of backup objects stored in at least one sequential backup device including the restore set of data for the restore point-in-time, wherein the determined backup objects are determined from a set of backup objects including a full volume backup and delta backups providing data in the volume at different points-in-time, and wherein extents in different backup objects providing data for blocks in the volume at different points-in-time are not stored contiguously in the sequential backup device. A determination is made of extents stored in the at least one sequential backup device for the determined backup objects. The determined extents are sorted according to an order in which they are stored in the at least one sequential backup device to generate a sort list. The extents are retrieved from the at least one sequential backup device according to the order in the sort list to access the extents sequentially from the sequential backup device in the order in which they were stored. The retrieved extents are returned to the client and the client reconstructs the restore data set from the received extents. | 2012-06-21 |
20120158667 | ASSET MANAGER - A method may include automatically receiving content and metadata; automatically identifying a source metadata format of the metadata; automatically identifying a target metadata format; automatically selecting a data map to perform validation of the metadata and at least one of transforming or translating of the metadata based on the identifying of the source metadata format and the identifying of the target metadata format, wherein the transforming includes converting the metadata to the target metadata format and the translating includes converting a file type of the metadata to a target metadata file type; and automatically attempting to validate the metadata based on the data map; automatically performing the at least one of the transforming or the translating of a validated metadata when the metadata is validated based on the data map, wherein the transforming includes converting the validated metadata to the target metadata format including one or more extendible fields. | 2012-06-21 |
20120158668 | STRUCTURING UNSTRUCTURED WEB DATA USING CROWDSOURCING - A crowdsourcing data structuring system and method for capturing unstructured data from the Web and adding structure by placing the data in a document that is accessible by others in a cloud computing environment. Using crowdsourcing, the unstructured data is annotated, amended, and verified to add structure to the unstructured data. An anchor and update module convert the data to a pointer that links the document to the data at an information source and stores the pointer in the document rather than the data itself. The data displayed in the document is updated whenever the information source is updated. A contribution module allows users to add data to the document, a validation module allows users to determine the validity of the data linked to in the document, and an expert ranking module allows users to rank the expert or contributor of the data in the document. | 2012-06-21 |
20120158669 | DATA RETENTION COMPONENT AND FRAMEWORK - Systems and methods for dynamically managed data retention are described. The system comprises a tiered framework having a plurality of namespaces. The namespaces are configured by a user to have selected data retention attributes. Data including a manifest may be received by the system, processed, and directed to a namespace based upon the manifest. Data storage partitions may be created automatically in association with a namespace, and the data partitions may be assigned partition attributes. Data in a storage partition may be migrated automatically to another namespace based on the partition attributes. Code necessary for creating storage partitions and migrating data is generated by the data management system. | 2012-06-21 |
20120158670 | FINGERPRINTS DATASTORE AND STALE FINGERPRINT REMOVAL IN DE-DUPLICATION ENVIRONMENTS - A storage server is coupled to a storage device that stores blocks of data, and generates a fingerprint for each data block stored on the storage device. The storage server creates a fingerprints datastore that is divided into a primary datastore and a secondary datastore. The primary datastore comprises a single entry for each unique fingerprint and the secondary datastore comprises an entry having an identical fingerprint as an entry in the primary datastore. The storage server merges entries in a changelog with the entries in the primary datastore to identify duplicate data blocks in the storage device and frees the identified duplicate data blocks in the storage device. The storage server stores the entries that correspond to the freed data blocks to a third datastore and overwrites the primary datastore with the entries from the merged data that correspond to the unique fingerprints to create an updated primary datastore. | 2012-06-21 |
20120158671 | METHOD AND SYSTEM FOR PROCESSING DATA - Methods, computer systems, and computer program products for processing data a computing environment are provided. The computer environment for data deduplication storage receives a plurality of write operations for deduplication storage of the data. The data is buffered in a plurality of buffers with overflow temporarily stored to a memory hierarchy when the data received for deduplication storage is sequential or non sequential. The data is accumulated and updated in the plurality of buffers per a data structure, the data structure serving as a fragment map between the plurality of buffers and a plurality of user file locations. The data is restructured in the plurality of buffers to form a complete sequence of a required sequence size. The data is provided as at least one stream to a stream-based deduplication algorithm for processing and storage. | 2012-06-21 |
20120158672 | Extensible Pipeline for Data Deduplication - The subject disclosure is directed towards data deduplication (optimization) performed by phases/modules of a modular data deduplication pipeline. At each phase, the pipeline allows modules to be replaced, selected or extended, e.g., different algorithms can be used for chunking or compression based upon the type of data being processed. The pipeline facilitates secure data processing, batch processing, and parallel processing. The pipeline is tunable based upon feedback, e.g., by selecting modules to increase deduplication quality, performance and/or throughput. Also described is selecting, filtering, ranking, sorting and/or grouping the files to deduplicate, e.g., based upon properties and/or statistical properties of the files and/or a file dataset and/or internal or external feedback. | 2012-06-21 |
20120158673 | STORING AND PUBLISHING CONTENTS OF A CONTENT STORE - Aspects are disclosed for publishing contents of a content store. A storage operation is performed, and a completion of the storage operation is detected. Here, the storage operation redundantly stores contents of a content set onto instances associated with a content store. The contents stored in the instances are then published in response to the completion of the storage operation. In another aspect, a dataset table is generated to facilitate storing contents of a content set, which include payload and metadata. The payload is stored onto a payload table, and the metadata is stored onto a metadata table. For this embodiment, the dataset table includes a first foreign key to the payload table, whereas the metadata table includes a second foreign key to the dataset table. The dataset table is monitored to determine a storage status of the contents, and the contents are subsequently published based on the storage status. | 2012-06-21 |
20120158674 | Indexing for deduplication - Systems and methods of indexing for deduplication are disclosed. An example method includes providing a first table in a first storage and a second table in a second storage. The method also includes looking up a key in the first table. If the key is not found in the first table, the key is looked up in the second table. If the key is found in the second table, the key is copied from the second table to the first table. If the entry is not found or in the second table, an entry with the key is inserted in the first table. The method also includes applying an operation to the entry associated with the key in the first table. The method also includes merging data of the first table with data of the second table when the first table is full to produce a new version of the second table that replaces a previous version. | 2012-06-21 |
20120158675 | Partial Recall of Deduplicated Files - The subject disclosure is directed towards changing a file from a fully deduplicated state to a partially deduplicated state in which some of the file data is deduplicated in a chunk store, and some is recalled into the file, that is, in the file's storage volume. A partial recall mechanism such as in a file system filter tracks (e.g., via a bitmap in a file reparse point) whether file data is maintained in the chunk store or has been recalled to the file. Data is recalled from the chunk store as needed, and committed (e.g., flushed) to the file. Also described is efficiently returning the file to a fully deduplicated state by using the tracking information to determine which parts of the file are already deduplicated into the chunk store so as to avoid their further deduplication processing. | 2012-06-21 |
20120158676 | ENABLING RANDOM ACCESS WITHIN OBJECTS IN ZIP ARCHIVES - Objects stored in a zip archive may be extracted in random-access fashion (without involving other objects stored in the zip archive) using the addresses of the objects stored in the central directory of the zip archive. However, zip archives often provide insufficient information to enable random access to the data within an object. This capability may be provided by segmenting the object into sections of a section size, and including in the zip archive a block table specifying, for respective sections, the block size of the corresponding block. A zip archive extractor may achieve random access to the object by using the block table to computing the addresses of blocks comprising the selected portion and extracting only those blocks. Backwards compatibility of the zip archive with other zip archive extractors may be preserved by including the block table within a zip extension of the central directory of the zip archive. | 2012-06-21 |
20120158677 | SYSTEMS AND METHODS FOR STREAMING COMPRESSED FILES VIA A NON-VOLATILE MEMORY - This can relate to streaming compressed files via a non-volatile memory (“NVM”) of a media player. In particular, the NVM can stream compressed media files. The NVM can include an NVM controller and an NVM die storing the compressed media file. The NVM controller can read the compressed media file from the NVM die, decompress the media file, and send the decompressed media file to a digital-to-analog converter (“DAC”) for conversion to analog format. Since the decompression can be performed by the NVM itself, an application processor may be significantly removed from the media playback process. In some embodiments, it may only be necessary for the application processor to issue an initial read request and/or receive a completion confirmation from the NVM. This can result in significant power savings for the media player and can free the application processor for performing other functions of the media player. | 2012-06-21 |
20120158678 | PROCESS AND METHOD FOR DATA ASSURANCE MANAGEMENT BY APPLYING DATA ASSURANCE METRICS - The present invention relates generally to methods, software and systems for measuring and valuing the quality of information and data, where such measurements and values are made and processed by implementing objectively defined, measurable, comparable and repeatable dimensions using software and complex computers. The embodiments include processes, systems and method for identifying optimal scores of the data dimension. The invention further includes processes, systems and method for data filtering to improve the overall data quality of a data source. Finally, the invention further includes processes, systems and method for data quality assurance of groups of rows of a database. | 2012-06-21 |
20120158679 | Controlling Database Trigger Execution with Trigger Return Data - A database trigger generates a return code having the effect of inhibiting further executions of the trigger within a pre-defined scope of execution. Preferably, the pre-defined scope is a task or process executing on behalf of a particular user. Upon first encountering the applicable trigger condition, the corresponding trigger is fired normally. Internal logic within the trigger determines whether it is necessary to call the same trigger again within the same scope, and if not, generates corresponding return data. A database management system which manages the trigger and causes it to automatically fire intercepts the return data and disables further firing of the trigger for the pre-defined scope. | 2012-06-21 |
20120158680 | DATABASE SYSTEM PROVIDING HIGH PERFORMANCE DATABASE VERSIONING - A database system providing high performance database versioning is described. In a database system employing a transaction log, a method for restoring databases to a consistent version including creating a cache view of a shared cache and performing undo or redo operations on the cache view only when a log sequence number falls within a certain range. | 2012-06-21 |
20120158681 | VOLUMES AND FILE SYSTEM IN CLUSTER SHARED VOLUMES - The present invention extends to methods, systems, and computer program products for sharing volumes between clustered nodes. Embodiments of the invention include a Clustered Shared Volume File System (CsvFs) that appears to clients as a local file system. The CsvFs communicates to a node where a disk is mounted to coordinate access to files on the disks. CsvFs uses Opportunistic Locks (oplocks) to decide when direct access to a volume is safe. CsvFs can be extended with oplock upgrade mechanisms that allow a coordinating node to tell CsvFs when it is safe to attempt to upgrade oplock. CsvFs also uses a transitivity property of oplocks to be able to grant (delegate) oplocks to clients that are on top of CsvFs. | 2012-06-21 |
20120158682 | SCATTER-GATHER LIST USAGE FOR A CONFIGURATION DATABASE RETRIEVE AND RESTORE FUNCTION AND DATABASE BLOCKING AND CONFIGURATION CHANGES DURING A DATABASE RESTORE PROCESS - Disclosed is a method of reading and writing data to and from a transactional database using a scatter-gather routine that minimizes the time in which the database is subject to a transaction lock. Data is placed in a scatter-gather list in RAM, which speeds the process of reading and writing data to the database. Further, a process is disclosed for restoring data in a transactional database that is accessed by more than one controller. An alternate controller is held in reset mode and placed offline, so that data in the transactional database cannot be changed during the restoration process. In addition, the database is placed offline and the host is notified that the database is invalid, so that the host cannot access the transactional database. | 2012-06-21 |
20120158683 | Mechanism for Inode Event Notification for Cluster File Systems - A mechanism for inode event notification for cluster file systems is disclosed. A method of the invention includes implementing a lock scheme for a cache manager associated with an inode of a cluster file system, wherein the lock scheme includes a null lock (NL) used as a reference count for a lock value block (LVB) and an exclusive (EX) lock used for setting up inode event notifications, and associating a first global counter and a second global counter with the cache manager for the inode, wherein the first global counter is configured to track one or more processes that have the inode open in read-only mode and the second global counter is configured to track processes that have the inode open in read-write mode. | 2012-06-21 |
20120158684 | PERFORMANCE ENHANCED SYNCHRONIZATION MECHANISM WITH INTENSITY-ORIENTED READER API - A method for synchronizing data operations in a multi-threaded computer system using a hybrid lock data structure that allows the computer system to dynamically implement a low contention cost lock or a low overhead cost lock based on the intensity of the memory operation. | 2012-06-21 |
20120158685 | Modeling Intent and Ranking Search Results Using Activity-based Context - The subject disclosure is directed towards building one or more context and query models representative of users' search interests based on their logged interaction behaviors (context) preceding search queries. The models are combined into an intent model by learning an optimal combination (e.g., relative weight) for combining the context model with a query model for a query. The resultant intent model may be used to perform a query-related task, such as to rank or re-rank online search results, predict future interests, select advertisements, and so forth. | 2012-06-21 |
20120158686 | Image Tag Refinement - A computing device configured to determine a subset of the tags associated with at least one image of a plurality of received, tagged images is described herein. The computing device performs the determining based on one or more measures of consistency of visual similarity between ones of the images with semantic similarity between tags of the ones of the images. | 2012-06-21 |
20120158687 | DISPLAY ENTITY RELATIONSHIP - Method, system, and programs for providing one or more explanations. An inquiry is received via a communication platform where the inquiry is about how a set of entities are related. Information is retrieved from a knowledge storage in accordance with the set of entities and such information describes a plurality of entities and relationships existing among the plurality of entities. Based on such retrieved information, one or more explanations with respect to each relationship by which the set of entities are connected are generated. The one or more explanations are then transmitted as a response to the inquiry. | 2012-06-21 |
20120158688 | BUTTON-ACTIVATED CONTEXTUAL SEARCH - This patent application relates to button-activated contextual search techniques for providing contextually relevant search functionality on a display. The single button can be a search button on a pointing device (e.g., a computer mouse device, touch pad, track ball device, etc.) configured to move a pointer on the display. The pointer can be moved to a location that is on or near an entity on the display, allowing a search to be enabled and/or performed for that entity when the search button is activated (e.g., with a single user click). Furthermore, the search functionality can be based on one or more automatically generated search terms for the entity, and thus be contextually relevant to the entity. | 2012-06-21 |
20120158689 | SEARCHING FILES - Aspects of the subject matter described herein relate to searching files. In aspects, a search engine is able to search not only the current files but also is able to search for deleted and previous versions of files that satisfy queries. The search engine may maintain an index that facilitates searches. In addition, the search engine may also determine not only that a file satisfies a query but what version(s) of the file satisfies the query. | 2012-06-21 |
20120158690 | SYSTEMS AND METHODS FOR NETWORK SEARCHES INTEGRATED WITH IMAGE SENSOR MODULE - A method for network search integrated with an image sensor module is provided for an electric apparatus. An image is obtained by the image sensor module, wherein the image sensor module is coupled to the electric apparatus. The image is automatically inputted to an input field of a search engine, so as to search the image via a network. | 2012-06-21 |
20120158691 | APPARATUS AND METHOD OF SEARCHING HS CODES USING ONTOLOGY - An apparatus of searching a HS code for a product includes a database (DB) for storing HS codes with respect to various products, an ontology editor for converting the HS codes into an ontology, and a search unit for searching the DB for a HS code corresponding to a search word for the product by using the ontology of the HS codes. The search unit is configured to create a HS code ontology and a domain ontology with respect to the product having the search word, extract a feature vector with respect to an individual class of the HS code ontology, extend the extracted feature vector by using the domain ontology, and search for the HS code of the product by using the extended feature vector. | 2012-06-21 |
20120158692 | QUERY SYSTEMS - A query system for carrying out a query process corresponding to a received query element on a database system and/or a search-engine system, the query system comprising: a synchronisation unit operable, as a non-text-centric synchronisation process, to convert a non-text-centric data entry of the database system into a corresponding text-centric data entry representative of that non-text-centric data entry, and to enter the text-centric data entry into an index of the search-engine system so that the non-text-centric data entry of the database system is available to both the search-engine and database systems. | 2012-06-21 |
20120158693 | METHOD AND SYSTEM FOR GENERATING WEB PAGES FOR TOPICS UNASSOCIATED WITH A DOMINANT URL - Techniques are provided for identifying topics that are unassociated with a dominant URL. A set of keywords associated with a topic is identified. A search log is scanned to identify search queries associated with the set of keywords. The identified search queries are grouped into clusters. Clusters associated with similar URLs are merged to generate an extended seed query string. The extended seed query string is analyzed to determine whether it relates to an existing dominant URL. If the extended seed query string is determined to be unassociated with an existing dominant URL, a web page associated with the topic may be generated. | 2012-06-21 |
20120158694 | Combinators - A method of managing a database system that receives N number of requests from one or more nodes in the database system. The N requests are combined before initiating operations to attend to the requests. The number of operations to attend to the requests is reduced and this reduced number of operations is executed. | 2012-06-21 |
20120158695 | More efficient search algorithm (MESA) using: integrated system optimizer - MESA utilizes novel tools and strategies to more efficiently search and retrieve records from an electronic database. An Integrated System Optimizer (ISO) programmable computer system is electronically linked to related database platform systems to dynamically monitor, supervise, control, track and communicate the status of each database query. ISO analyzes IVR speaker dependent and speaker independent confidence levels; determines number of records in initial, subsequent and final subsets of records formed by AlphaOmega combinations and subsets formed by statistical, subjective and objective virtual search parameters; selects optimum search algorithms or search sequence for each query; determines the frequency of occurrence for AlphaOmega combinations; transmits optimum search activity for each query to database subsystems including Intelligent Queries to disambiguate similar records. | 2012-06-21 |
20120158696 | EFFICIENT INDEXING OF ERROR TOLERANT SET CONTAINMENT - The claimed subject matter provides a method and a system for the efficient indexing of error tolerant set containment. An exemplary method comprises obtaining a frequency threshold and a query set. All tokens or token sets within the query set are determined, and then all minimal infrequent tokens or all minimal infrequent tokens sets of data records are found and used to build an index. The minimal infrequent tokens or minimal infrequent tokensets are processed in a fixed order, and then a collection of signatures for each minimal infrequent token or token set is determined. | 2012-06-21 |
20120158697 | MATCHING VARIOUS COMBINATIONS OF XPATH URIS TO THE SAME XML NODE - Embodiments of the present invention address deficiencies of the art in respect to subscribing and updating nodes within XML documents and provide a novel and non-obvious method, system and computer program product for matching various combinations of XML Path Language (XPATH) Uniform Resource Identifiers (URIs). In one embodiment of the invention, a method for matching various combinations of XML Path Language (XPATH) Uniform Resource Identifiers (URIs) that includes receiving a XPATH expression for a node in an XML document, retrieving the node identified by the XPATH expression, determining if a template exists for the identified node, where the template resides in a database of a document management system, comparing the template expression to the XPATH expression and determining if the expressions match. The method can further include modifying the XPATH expression to account for a dominant attribute required by the template when the XPATH expression does not match the template expression and returning the modified XPATH expression. | 2012-06-21 |
20120158698 | EXECUTION PLANS WITH DIFFERENT DRIVER SOURCES IN MULTIPLE THREADS - In an embodiment, a first driver source specified by a first execution plan that implements a query is designated, and a second driver source specified by a second execution plan that implements the query is designated. A portion of the first execution plan and a portion of the second execution plan are executed. If a unique identifier of a first row returned by the executing the portion of the first execution plan does not match all unique identifiers of all rows from the second driver source that were saved to a result set by the executing the portion of the second execution plan, then the first row returned by the executing the portion of the first execution plan is added to the result set and the unique identifier of the first row that was returned by the executing the portion of the first execution plan is added to a unique identifier log. | 2012-06-21 |
20120158699 | REPACKAGEABLE VIRTUALIZED TRANSPARENT ACCESS TO HETEROGENEOUS DATA SOURCES - A transparent data access interface/layer for repackageable virtualized transparent access to heterogeneous business process data sources, internally maintained or outsourced, is disclosed. This data access interface provides substantially real time customer/client specific, i.e. transparent, access to a customer/client generic enterprise storage and data processing architecture, such as an architecture operated by a business process outsourcing organization (“BPO”), which includes multiple disparate/heterogeneous data sources, having disparate formats and access methodologies, storing and processing customer/client specific data for multiple customers, while also permitting similarly transparent access across the enterprise storage architecture, e.g. across multiple customers/clients, such as for BPO-internal processing and reporting requirements. The data stored in the data sources may include data collected/received from the customer of the BPO, such as data identifying the BPO's customer's customers/clients and/or business processing rules or algorithms, data received/collected from the customers/clients of the BPO's customer, such as transactional data, e.g. insurance claims, etc., data calculated or computed by the BPO based on stored or collected data, data representative of business processing rules developed by the BPO, such as rules for maintaining customer specific service level agreements, or combinations thereof. | 2012-06-21 |
20120158700 | FACE RECOGNITION USING SOCIAL DATA - Faces may be indexed and identified using visual and social criteria. In one example, the visual features of a face are quantified, and the quantification of the features is represented in a vector. Aspects of the vector are then represented in the form of text strings. Social context surrounding the face is also represented in the form of text strings. The text strings—both the visual-based strings and/or the social-based strings—are associated with the face, and are stored in an index. The association of these strings with the face then may make the face text-searchable on both its visual and social features. Searches on these visual and/or social features may be used to help to assist in identifying new images of faces, or to propose tags for users to apply to photos. | 2012-06-21 |
20120158701 | COMPUTER PRODUCT, DATA CONVERSION APPARATUS, AND CONVERSION METHOD - A computer-readable medium storing therein a data conversion program that causes a computer to execute a process that includes receiving after a schema of a database has been changed from a former schema to a new schema, a processing request concerning the database; judging based on difference information concerning the former schema and the new schema, whether in the processing request, a condition that specifies process data subject to processing, has been changed by the new schema; searching the database for conversion data whose format is to be converted from the former schema to the new schema, the searching based on judgment results obtained at the judging and on the processing request; and converting the format of the retrieved conversion data, from the former schema to the new schema. | 2012-06-21 |
20120158702 | Classifying Results of Search Queries - Computer-readable media, computer systems, and computing methods are provided for classifying search results as either of good quality or of poor quality. Initially, a portion of the search results, such as the highest ranked documents, are selected for evaluation. A level of quality for each of the selected search results is determined using a classification process that includes the following steps: targeting features demonstrated by the selected search results to be evaluated; evaluating the selected features to generate a level-of-quality score for each of the selected search results; comparing the score against a predefined threshold value; and, based on the comparison, assigning each of the selected search results an absolute measurement. The absolute measurement indicates poor quality when the score is less than the threshold value. Upon recognizing that the selected search results are of poor quality, automatically executing a corrective action that reformulates the issued search query. | 2012-06-21 |
20120158703 | SEARCH LEXICON EXPANSION - One or more techniques and/or systems are disclosed for creating an expanded or improved lexicon for use in search-based semantic tagging. A set of first documents can be identified using a set of first lexicon elements as queries, and one or more first document patterns can be extracted from the set of first documents. The document patterns can be used to find one or more second documents in a query log that comprise the document patterns, which are associated with query terms used to return the second documents. The query terms for the second documents can be extracted and used to expand the lexicon. Elements within the lexicon may be weighted based upon relevance to different query domains, for example. | 2012-06-21 |
20120158704 | GEOSPATIAL INCONSISTENCIES IDENTIFICATION DATA SYSTEM BASED ON CONTRACTUAL RIGHTS AND GEOGRAPHICAL NETWORK ANALYSIS - An application document for a contractual right can be identified. The application document can be a new application seeking a contractural right or an existing one for which a contractual right has already been granted yet which is being verified herein. The contractual right can define a compensatory relationship between two entities for specified conditions. At least one address can be determined from the application document, where activities related to the contractual right are to be performed. The address can be converted into geospatial coordinates. A database of geospatially recorded items can be queried for activities proximate to the geospatial coordinates. A geospatial inconsistency score can be generated based on the results from the database and their level of incompatibility with conducting the activity for which the contractual right is related. Related methods, apparatus, systems and articles are also described. | 2012-06-21 |
20120158705 | LOCAL SEARCH USING FEATURE BACKOFF - A local search system is described herein that provides a framework for the integration of various external sources to improve local search ranking. The framework provided by the local search system described herein uses a notion of backoff. The system uses a generalization of the concept of backoff to improve local search results that incorporate a variety of data features. The system can apply backoff in multiple dimensions at the same time to generate features for local search ranking. The system integrates various additional data sources, such as web access logs, driving direction request logs, reviews, and so forth, to quantify popularity and distance (or distance sensitivity) into a framework for local search ranking. Thus, the system provides search results that are more relevant by incorporating a number of data sources into the ranking in a manner that handles abnormalities in the data well. | 2012-06-21 |
20120158706 | GRAPHICALLY REPRESENTING ASSOCIATIONS BETWEEN REFERENTS AND STORIES - Systems and methods are provided for graphically representing associations between one or more stories and one or more referents of interest. In some embodiments, a score may be determined for each of a set of stories based at least in part on a number of associations between the given story and one or more referents of interest. A graphical representation of the stories may then be presented for display. The graphical representation may include indicia, where each indicium graphically indicates the strength of association between a given story and the one or more referents of interest. The strength of association for a given story may be determined, for example, based at least in part on the determined score for the story. | 2012-06-21 |
20120158707 | GRAPHICALLY REPRESENTING ASSOCIATIONS BETWEEN REFERENTS AND POINTS IN A STORY - Systems and methods are provided for graphically representing associations between one or more points in a story and one or more referents of interest. In some embodiments, a score may be determined for each of a set of points in a story based at least in part on a number of associations between the given point in the story and one or more referents of interest. A graphical representation of the points in the story may then be presented for display. The graphical representation may include indicia, where each indicium graphically indicates the strength of association between a given point in the story and the one or more referents of interest. The strength of association for a given point in the story may be determined, for example, based at least in part on the determined score for the point. | 2012-06-21 |
20120158708 | SYSTEM AND METHOD FOR DISPLAY AND FORECASTING CONTENT AVAILABILITY - In a method and system for forecasting an availability of content, a selection of a media content item is received. Metadata related to the selected media content item is retrieved from a database record corresponding to the media content item. The metadata includes release data for at least one release window associated with the media content item. Based on the release data indicating the media content item has been released in a release window of the at least one release window, an actual release date for the release window is presented to the client device. Based on the release data indicating the media content item has not been released in the release window of the at least one release window, an estimated release date and a confidence indicator for the estimated release date for the release window are generated using the retrieved metadata. The estimated release date and the confidence indicator are presented to the client device. | 2012-06-21 |
20120158709 | Methods and Apparatus for Incrementally Computing Similarity of Data Sources - Methods and systems for efficiently determining a similarity between two or more datasets. In one embodiment, the similarity is determined based on comparing a subset of sorted frequency-weighted blocks from one dataset to a subset of sorted frequency-weighed blocks from another dataset. Data blocks of a dataset are converted into hash values that are frequency-weighted. These frequency-weighted hash values can be compared to frequency-weighted hash values of another dataset to determine a similarity of the two datasets. In another embodiment, upon a change of a block in a subset of the dataset, the similarity value is re-determined without resorting or hashing the blocks of a dataset other than the blocks of the subset, resulting in an increased performance of a similarity comparison. In another embodiment, blocks of a dataset are excluded based on a block-filtering rule to increase the accuracy of the similarity comparison. | 2012-06-21 |
20120158710 | MULTI-TIERED INFORMATION RETRIEVAL TRAINING - Methods and systems for multi-tiered information retrieval training are disclosed. A method includes identifying results in a ranked ordering of results that can be swapped without changing a score determined using a first ranking quality measure, determining a first vector and at least one other vector for each identified swappable result in the ranked ordering of results based on the first ranking quality measure and at least one other ranking quality measure respectively, and adding the first vector and the at least one other vector for each identified swappable result in the ranked ordering of results to obtain a function of the first vector and the at least one other vector. Access is provided to the function of the first vector and the at least one other vector for use in the multi-tiered information retrieval training. | 2012-06-21 |
20120158711 | SYSTEMS AND METHODS FOR IMPROVING THE RANKING OF NEWS ARTICLES - A system ranks results. The system may receive a list of links. The system may identify a source with which each of the links is associated and rank the list of links based at least in part on a quality of the identified sources. | 2012-06-21 |
20120158712 | Inferring Geographic Locations for Entities Appearing in Search Queries - A server system associates one or more locations with a query by identifying the query, selecting a set of documents responsive to the query, and assigning weights to respective documents in the set of documents based, at least in part, on historical data of user clicks selecting search result links in search results produced for historical queries substantially the same as the identified query. Websites hosting the selected documents are identified, and, for each website, location-specific information for one or more locations is retrieved, including a location-specific score that corresponds to the likelihood that the respective location corresponds to a respective website. For each respective location for which location-specific information was retrieved, aggregating the location-specific scores, as weighted by the document weights, to compute an aggregated likelihood that the respective location is associated with the query. A specific location is assigned to the query when predefined criteria are satisfied. | 2012-06-21 |
20120158713 | RANKING MEDIA CONTENT FOR CLOUD-BASED SEARCHES - A device receives, from a user device, a search query for media content within a content delivery network. The device identifies a group of relevant media content in the content delivery network, where the identifying is based on the search query, access restrictions of particular media content within the content delivery network, and/or a capability of the user device to present particular types of media content. The device associates sub-scores with each piece of media content in the group of relevant media content, and calculates a total score, for each piece of media content in the group of relevant media content, based on the sub-scores. The device ranks each piece of media content in the group of relevant media content, based on the total scores for each piece of media content, and sends, based on the search query, a list of the ranked, relevant media content to the user device. | 2012-06-21 |
20120158714 | STORAGE AND SEARCHING OF TEMPORAL ENTITY INFORMATION - A system may include determination of a plurality of data structures associated with an entity, each of the plurality of data structures associated with a respective validity period, determination of a plurality of non-overlapping time periods based on the validity periods, the plurality of non-overlapping time periods collectively spanning all of the validity periods, determination, for each of the plurality of non-overlapping time periods, of a composite data structure based on each of the data structures associated with a validity period including the non-overlapping time period, assignment of a respective document identifier to each composite data structure, each document identifier indicating the entity, and indexing of the composite data structures within an index. | 2012-06-21 |
20120158715 | ON-LINE SOCIAL SEARCH - Example methods, apparatuses, or articles of manufacture are disclosed that may be implemented using one or more computing devices to facilitate or otherwise support one or more processes or operations in connection with performing information searches, such as, for example, domain-specific on-line searches using social survey-type queries. | 2012-06-21 |
20120158716 | IMAGE OBJECT RETRIEVAL BASED ON AGGREGATION OF VISUAL ANNOTATIONS - An approach for responding to a text-based query for a digital image is provided. A request that identifies one or more keywords is received. A number of annotated digital images are selected based on a previously determined optimum quantity of annotated digital images. Composite data is gathered from each annotated digital image and a set of candidate digital images is selected based on the composite data. The set of candidate images are the digital images, of a set of digital images, which have a visual appearance that is most similar to the composite data. A response is generated that identifies those digital images which are most responsive to the one or more keywords. Alternatively, a partitioned response is generated which identifies dissimilar sets of digital images. | 2012-06-21 |
20120158717 | VISUALIZATION OF RELEVANCE FOR CONTENT-BASED IMAGE RETRIEVAL - The invention relates to a system ( | 2012-06-21 |
20120158718 | INVERTED INDEXES WITH MULTIPLE LANGUAGE SUPPORT - A search query for a collection of electronic documents is parsed to identify one or more terms and such identified terms are associated with one or more languages (i.e., spoken languages such as English, German, Spanish, etc.). A terms inverted index and a language inverted index are accessed to identify documents responsive to the query. Related apparatus, systems, techniques and articles are also described. | 2012-06-21 |
20120158719 | SYSTEM AND METHOD FOR PROVIDING FEEDS BASED ON ACTIVITY IN A NETWORK ENVIRONMENT - A method is provided in one example and includes receiving network traffic associated with a particular user; developing a personal vocabulary for the particular user based on the network traffic; determining areas of interest for the particular user based on the personal vocabulary; determining associations for the particular user in relation to additional users; and generating a feed based on a portion of the network traffic. The feed is delivered to a subset of the additional users. | 2012-06-21 |
20120158720 | SOCIAL NETWORK POWERED SEARCH ENHANCEMENTS - Embodiments of the present invention enhance the search experience of a user by looking at the search history of one or more friends to provide search enhancements to the user. The search enhancements may also be based on information within a user's online social network. Search enhancements based on the user's online social network include identifying people within the user's social network that may have information relevant to a query, posts within the social network that are relevant to the query, and feed items. Examples of search enhancements include an annotation or graphic adjacent to a search result indicating the search result has been visited by one of the user's friends. In another aspect, alternative queries from the friends' search history may be suggested to the user during the search session. | 2012-06-21 |
20120158721 | Tag Association with Image Regions - A computing device configured to determine that one or more regions of an image are associated with a tag of the image is described herein. The computing device is further configured to determine one or more attribute tags describing at least one of the content or context of the one or more regions. Upon determining the attribute tags, the computing device associates the attribute tags with the tag to enable image searching based on the tag and attribute tags. | 2012-06-21 |
20120158722 | DATABASE PARTITION MANAGEMENT - Apparatus, systems, and methods may operate to receive a request to move at least a portion of a database table stored on a tangible medium from a current partition to a history partition, wherein the database table is partitioned into physical partitions according to a selected mapping update frequency. In response to receiving the request, activities may include modifying a logical partitioning of the database table by updating a mapping of the physical partitions to logical partitions. Other apparatus, systems, and methods are disclosed. | 2012-06-21 |
20120158723 | Data Grid Advisor - A system and method to generate an improved layout of a data grid in a database environment is provided. The data grid is a clustered in-memory database cache comprising one or more data fabrics, where each data fabric includes multiple in-memory database cache nodes. A data grid advisor capability can be used by application developers and database administrators to evaluate and design the data grid layout so as to optimize performance based on resource constraints and the needs of particular database applications. | 2012-06-21 |
20120158724 | AUTOMATED WEB PAGE CLASSIFICATION - Described herein are methods and systems implementing a web page classification system for automatically generating at least one context feature for a web page and classifying the web page based on the at least one context feature. In one implementation, a context feature generating module of the web page classification system is configured to automatically generate at least one context feature based on at least two of uniform resource locator (URL) features, title features, and meta tags features of a web page and a classifying module is configured to classify the web page based on the at least one context feature. | 2012-06-21 |
20120158725 | Dynamic hierarchical tagging system and method - A dynamical hierarchical tagging system connected to a user site through a remote communications network. The system may comprise a master controller, a job management server connected to the master controller, one or more scanners in communication with the job management server, wherein the one or more scanners are configured to scan for one or more user assets located at the user site, resulting in scan results, a scan logic processor connected to the master controller, wherein the scan logic processor is configured to store the scan results in a user database, a tagging logic engine connected to the master controller, wherein the tagging logic engine is configured to tag the scan results stored in the user database, and an indexing logic processor connected to the master controller, wherein the indexing logic processor is configured to search and index the tagged scan results stored in the user database. | 2012-06-21 |
20120158726 | Method and Apparatus For Classifying Digital Content Based on Ideological Bias of Authors - A method and apparatus for classifying a collection of digital documents based on ideological bias of authors. At least a portion of text of a digital document is received and parsed. Pairs of specific features text having specified relationships are detected. The pairs are then mapped to an ideological bias, based on an ideological bias ontology for example. Various actions can be taken on the digital documents based on the determined ideological bias. | 2012-06-21 |
20120158727 | NEGOTIABLE INSTRUMENT ELECTRONIC CLEARANCE SYSTEMS AND METHODS - Methods, devices, and systems for analyzing negotiated negotiable instruments for unlawful activity are described. A computer system, including a computer readable storage device and a processor may be provided. A plurality of electronic files may be received. Each of these electronic files of the plurality of electronic files may include an electronic image of at least a portion of a negotiable instrument and include a plurality of data fields. The plurality of electronic files may be divided into subsets based on whether data is available in particular data fields of the electronic files. Based upon the subset an electronic file is made a member of, various selection criteria may be applied to determine if the electronic file is a candidate for suspicious and/or illegal activity. Also, a listing of candidates for suspicious and/or illegal activity may be presented to a user. | 2012-06-21 |
20120158728 | SYSTEMS AND METHODS FOR TAGGING EMAILS BY DISCUSSIONS - The invention provides for techniques to process and produce email documents. The techniques provide for organizing a first plurality of email documents into a plurality of document groups, reviewing a document group from the plurality of document groups, and associating a review content with the document group. The techniques provide for ways to propagate the review content to one or more email documents associated with the document group and producing a second plurality of email documents. The techniques provide for annotating one or more email documents in accordance with the review content. Depending on the embodiment, review content may include text, graphics, audio, tag, and multimedia information. Produced documents can be searched and browsed in accordance with information in the review content. Email documents can be grouped by information in meta information and/or header information associated with the email documents into various groups, including threads or conversations, for example. | 2012-06-21 |
20120158729 | CONCURRENT LINKED-LIST TRAVERSAL FOR REAL-TIME HASH PROCESSING IN MULTI-CORE, MULTI-THREAD NETWORK PROCESSORS - Described embodiments process hash operation requests of a network processor. A hash processor determines a job identifier, a corresponding hash table, and a setting of a traversal indicator for a received hash operation request that includes a desired key. The hash processor concurrently generates a read request for a first bucket of the hash table, and provides the job identifier, the key and the traversal indicator to a read return processor. The read return processor stores the key and traversal indicator in a job memory and stores, in a return memory, entries of the first bucket of the hash table. If a stored entry matches the desired key, the read return processor determines, based on the traversal indicator, whether to read a next bucket of the hash table and provides the job identifier, the matching key, and the address of the bucket containing the matching key to the hash processor. | 2012-06-21 |
20120158730 | AUTOMATIC DISCOVERY OF METADATA - This is directed to processing stored data to automatically generate metadata for the stored data. In particular, this is directed to identifying metadata associated with stored data, and identifying other data that relates to the stored data from one or more sources. A processing module can identify other data sharing some of the identified metadata, and can extract additional metadata associated with the identified other data. The extracted metadata can then be associated with the user's stored data. The processing module can extract additional metadata from any suitable source, including for example local application data, social networks or blogging sources, and other remote sources. In some embodiments, an electronic device can retrieve data from other users for a particular event based on metadata associated with the user's data for the event to form a master collection of data. | 2012-06-21 |
20120158731 | DERIVING DOCUMENT SIMILARITY INDICES - The present invention extends to methods, systems, and computer program products for deriving document similarity indices. Embodiments of the invention include scalable and efficient mechanisms for deriving and updating a document similarity index for a plurality of documents. The number of maintained similarities can be controlled to conserve CPU and storage resources. | 2012-06-21 |
20120158732 | BUSINESS APPLICATION PUBLICATION - A data marketplace infrastructure provides a crowd sourcing solution to development, discovery and publication of decision applications. Applications can be submitted from a user to a data warehouse in association with a data feed. One or more discovery properties are determined with regard to each application. The applications are made available to other client systems in association with the data feed. A relevant data feed and a relevant application can be identified based on satisfaction of a discovery request by the one or more determined discovery properties of the application. The application can be selected and downloaded to the user for evaluation and customization. The customized application can then be submitted to the data warehouse for publication with the other applications associated with the data feed. | 2012-06-21 |
20120158733 | SYSTEM AND METHOD OF MANAGING COMMUNITY-BASED AND CONTENT-BASED INFORMATION NETWORKS - A system for storing, managing, and accessing information on a network by providing an interface between a social network and a content network includes an applications platform. The system provides messaging and social networking facility incorporating enhanced instant messaging, file synchronization, network presence, interactive chat capabilities, text messaging, voice and video messaging, blogging, and email. The system includes a viewer, an indexing facility, and a storage facility. The viewer enables users to traverse content and provides services based upon context of time, place, structure, node, and observed user behavior. The viewer provides a means for users to interact with information on the network and services to manipulate information and transact activities. The indexing facility manages the structure of the network and tracks attributes and controlled vocabularies. The indexing facility supports navigation across the structure and resolves the logical index to a physical storage location. The storage facility provides physical persistence for an information component. | 2012-06-21 |
20120158734 | DATA MANAGEMENT SYSTEM AND METHOD - A data management apparatus includes an index generation unit configured to subdivide an entire interval of data into bucket intervals, allocate indices for the respective bucket intervals, transform the bucket intervals having the allocated indices into bucket intervals of specific lengths, and generate bucket-based indices for pieces of data included in the bucket intervals of the specific lengths. The data management apparatus further includes a data management unit configured to transmit the encrypted data and the bucket-based indices to a server-side data management apparatus in order to store the encrypted data, transmit a user query to the server-side data management apparatus in order to search for a desired encrypted data, and decrypt encrypted data corresponding to the user query from the server-side data management apparatus. The user query includes the index of first bucket interval and the index of second bucket interval neighboring to the first bucket interval. | 2012-06-21 |
20120158735 | Method and System for Aggregating Reviews and Searching within Reviews for a Product - The embodiments disclosed herein include new, more efficient ways to collect product reviews from the Internet, aggregate reviews for the same product, and provide an aggregated review to end users in a searchable format. One aspect of the invention is a graphical user interface on a computer that includes a plurality of portions of reviews for a product and a search input area for entering search terms to search for reviews of the product that contain the search terms. | 2012-06-21 |
20120158736 | VIRTUAL R-TREE MAPPED TO AN EXTENDIBLE-HASH BASED FILE SYSTEM - Techniques for mapping a virtual R-Tree to an extensible-hash based file system for databases are provided. Spatial data is identified within an existing file system, which stores data for a database. Rows of the spatial data are organized into collections; each collection represents a virtual block. The virtual blocks are used to form an R-Tree spatial index that overlays an existing index for the database on the existing file system. Each row within its particular virtual block includes a pointer to its native storage location within the existing file system. | 2012-06-21 |
20120158737 | SYSTEM AND METHOD FOR HYPERTEXT TRANSFER PROTOCOL LAYERED RECONSTRUCTION - HTTP layered reconstruction is disclosed. A database is queried to identify a location of a previously reconstructed HTML artifact file or packet data of a HTML file in a repository that stores packet data captured from a network. The reconstructed HTML file is analyzed. Links to external files are identified and the database is queried to identify a location of previously reconstructed artifact files or packet data of associated external files. The external files are reconstructed, as needed. A web page is then reconstructed based on the reconstructed HTML file and reconstructed external files, presenting a view of the web page as it originally appeared to a user. A user may specify which external file types to include and/or not include. New versions of external files may be obtained and indicated in the reconstructed web page when associated artifact files or packet data are not stored within the repository. | 2012-06-21 |
20120158738 | Inference Indexing - Methods, systems, and media are provided for facilitating generation of an inference index. In embodiments, a canonical entity is referenced. The canonical entity is associated with web documents. One or more queries that, when input, result in a selection of at least one of the web documents are identified. An entity document is generated for the canonical entity. The entity document includes the identified queries and/or associated text from the content of a document or from an entity title that result in the selection of the at least one of the web documents. The entity document and corresponding canonical entity can be combined with additional related entity documents and canonical entities to generate an inference index. | 2012-06-21 |
20120158739 | SYSTEM AND METHOD FOR MULTIMEDIA INFORMATION RETRIEVAL - A system and method for information retrieval are disclosed. The method includes querying a multimedia collection with a first component of a multimedia query (e.g., a text-based part of the query) to generate first comparison measures between the first component of the query and respective objects in the collection for a first media type (e.g., text). The multimedia collection is queried with a second component of the multimedia query (e.g., an image-based part of the query) to generate second comparison measures between the second component of the query and respective objects in the collection for a second media type (e.g., visual). An aggregated score for each of a set of objects in the collection is computed, based on the first comparison measure and the second comparison measure for the object. This includes applying an aggregating function to the first and second comparison measures in which a first confidence weighting is applied to the first comparison measure and a second confidence weighting is applied to the second comparison measure. The first confidence weighting is independent of the second comparison measure. The second confidence weighting is dependent on the first comparison measure. Information based on the aggregated scores is output. | 2012-06-21 |
20120158740 | CACHING WEB DOCUMENTS IN TWO OR MORE CACHES - A system and method is described herein that cache web documents in two or more caches in an optimized manner. The web documents result from a plurality of queries presented to a web search engine. Each web document has a tier score indicating a position of the web document in the caches. The tier scores are modified in a manner that rearranges the web documents in caches. This rearrangement of the web documents in the caches can advantageously improve the retrieval time for the web documents. | 2012-06-21 |
20120158741 | COLLABORATIVE FILTERING WITH HASHING - Systems, methods, and machine readable and executable instructions are provided for collaborative filtering. Collaborative filtering includes representing users and objects by rows and columns in an ordinal ratings matrix having a particular dimensional space. Values in the ordinal ratings matrix are weighted with a weight matrix having the particular dimensional space. The weight matrix is hashed into a lower dimensional space by one of row and column by multiplying a projection matrix by the weight matrix. The ordinal ratings matrix is hashed into a lower dimensional space by multiplying the projection matrix by an element-wise product of the weight matrix and the ordinal ratings matrix to form a reduced ratings matrix, and element-wise dividing the reduced ratings matrix by the hashed weight matrix. The hashed ordinal ratings matrix and the hashed weight matrix are low-rank approximated by alternating least squares. A result of the low-rank approximation for the one of row and column is updated using the ordinal ratings matrix and the weight matrix. A recommendation of one of the objects can be generated for one of the users based on the updated result. | 2012-06-21 |
20120158742 | MANAGING DOCUMENTS USING WEIGHTED PREVALENCE DATA FOR STATEMENTS - In an embodiment, respective strengths are determined for respective relationships in respective statements. Weights are decreased for the respective statements in proportion to respective amounts of time since the respective statements were added to documents. The weights are increased for a subset of the statements that were modified in a subset of the documents. Weighted prevalence data is calculated for respective time periods for the respective statements to be a sum of the weights for the respective statements in the time periods for those statements that have the respective strengths. | 2012-06-21 |
20120158743 | SYSTEM AND METHOD FOR MATCHING CONTENT BETWEEN SOURCES - In a method and system for matching content between content sources, a first set of metadata describing a first content item is compared to a second set of metadata describing a second content item. Based on the comparing, an accuracy score is generated. The accuracy score indicates an amount of similarity between the first set of metadata and the second set of metadata. The accuracy score is compared to a predetermined accuracy threshold value. Based on the accuracy score being greater than or equal to the predetermined accuracy threshold value, a determination is made that the first content item and the second content item are a match. Based on the accuracy score being less than the predetermined accuracy threshold value, a determination is made that the first content item and the second content item are not a match. | 2012-06-21 |
20120158744 | RANKING AND UPDATING OF CONTACT INFORMATION FROM MULTIPLE SOURCES - Collecting contact information for a plurality of contact entities from various sources and ranking the contact information based at least on the sources. The ranking of the contact information is determined based on the reliability of the sources. The ranked contact information is shared with users subject to privacy settings. The privacy setting allows the users or the contact entity to share certain contact information with others while keeping certain contact information privately or sharing the contact information with a limited number of users. After a change in the contact information from a reliable source is detected, the change may be propagated to other sources or client devices of the users. | 2012-06-21 |
20120158745 | Semantic Discovery and Mapping Between Data Sources - An apparatus and method are described for the discovery of semantics, relationships and mappings between data in different software applications, databases, files, reports, messages, or systems. In one aspect, semantics and relationships and mappings are identified between a first and a second data source. A binding condition is discovered between portions of data in the first and the second data source. The binding condition is used to discover correlations between portions of data in the first and the second data source. The binding condition and the correlations are used to discover a transformation function between portions of data in the first and the second data source. | 2012-06-21 |
20120158746 | GEOSPATIAL OBJECT PROPERTY ASSESSMENT APPARATUS, ASSESSMENT SYSTEM, EDITOR APPARATUS AND METHOD OF ASSESSING PROPERTY OF A GEOSPATIAL OBJECT - A geospatial object property assessment apparatus comprises a processing resource ( | 2012-06-21 |
20120158747 | SYSTEM AND METHOD FOR PERFORMING AUTHORITY BASED CONTENT SEARCHING - Systems and methods for performing authority based content searching are disclosed. In some embodiments, a method comprises receiving user queries containing authority keywords and relevancy keywords and ranking a set of search results on the basis of the authority of the authors of entries within the search results. The authority of each author is expressed in an authority quotient which is calculated by determining an authority keyword score, a name score, a domain name score and a credential score based on the authority keyword provided by the user. | 2012-06-21 |
20120158748 | RANKING REAL ESTATE BASED ON ITS VALUE AND OTHER FACTORS - Real estate ranking computation is calculated to sort real estate properties. Such computations use available information regarding real estate properties in any local markets and may help the real estate buyer to identify real estate properties with various ranked financial values. Suitably, a relatively small geographic area can be used based on the real estate buyer's specified criteria, and the real estate ranking computation is able to handle interactions among predictor variables, possesses suitable predictive confidence, and includes the capability for dynamically adjusting the underlying ranking computation as new patterns of real estate market emerge over time. | 2012-06-21 |
20120158749 | SYSTEM AND METHOD FOR PROVIDING TAG-BASED RELEVANCE RECOMMENDATIONS OF BOOKMARKS IN A BOOKMARK AND TAG DATABASE - A method comprises identifying a first user having stored in a database a set of first bookmarks associated with a topic of interest; determining a level of relatedness of a second user to the first user by comparing a first number of overlapping bookmarks that were stored in the database by the second user and that overlap the set of first bookmarks; determining a level of value of the second user to the first user by comparing a second number of related nonoverlapping bookmarks that were stored in the database by the second user that, relate to the topic of interest, and that do not overlap the set of first bookmarks; and presenting at least a portion of the related nonoverlapping bookmarks to the first user. | 2012-06-21 |
20120158750 | SYSTEMS AND METHODS FOR PROVIDING ACCESS TO MEDICAL INFORMATION - Various aspects and embodiments of the present invention relate to providing a medical application with access to medical information from validated medical information experts. The medical information experts can be validated by scoring attributes of a purported medical information expert, generating a rank based on the score, and comparing the score to a pre-set threshold. The medical information from validated medical information experts can be stored in a knowledge database. A request from a medical application can be received and used to search the knowledge database to generate a response to the request that includes part of the medical information. The response can be provided to the medical application in a format that can be customized by the medical application. | 2012-06-21 |
20120158751 | Ranking of Address Book Contacts Based on Social Proximity - In one embodiment, a user of a social networking system requests to look up an address book maintained by the social networking system. The social networking system improves the look up search results by ranking one or more contacts in the address book based on social graph, social relationship and communication history information. | 2012-06-21 |
20120158752 | RENDERING SELECTED AND UNSELECTED LISTS OF AN ITEM SET - An item set may comprise items respectively having a selection status, such as a selected item and an unselected item. The item set may be presented as a selected list and an unselected list having various properties (e.g., mutual exclusivity, such that an item appears on at most one list; both lists sorted according to a sort order; and the unselected list having an unselected list size limit, with unselected items appearing in the unselected list based on a priority order). In order to render the selected list and the unselected list, an item list may be generated that attaches to respective items a selected marker (indicating that the item appears in the selected list) or a hidden marker (indicating that the item does not appear in either the selected list or the unselected list), where the item list is also sorted according to the sort order. | 2012-06-21 |
20120158753 | Comment Ordering System - In one embodiment, a social networking system receives a request by a first user for user comments associated with a content object, accesses a data store of user comments to retrieve a set of user comments associated with the content object, orders the set of user comments based on a time value associated with each comment of the set of user comment, adjusts the order of user comments based on social graph information of the first user, and presents the adjusted list of user comments to the first user. | 2012-06-21 |
20120158754 | AUTOMATED GENERATION OF ANALYTIC AND VISUAL BEHAVIOR - A data marketplace infrastructure allows a data source company or a third party to automate generation of one or more applications in association a data feed. In contrast to custom, manual development of applications, the data marketplace infrastructure constructs applications that suggest applicability to the data feed. Factors suggesting applicability include without limitation similarity of data structures and similarity of subject matter. Based on an applicability determination, patterns of historical visual usage and patterns of historical business logic usage may be used to identify expressions specifying the visuals and business logic that may be copied to and used in a new application in association with the data feed. Furthermore, previewers can provide feedback to help tune which automatically generated applications are maintained in association with the data feed and which are discarded or altered in some way. | 2012-06-21 |
20120158755 | GRANULAR METADATA FOR DIGITAL CONTENT - Accordingly, the present discussion is directed in one respect; to a method of associating metadata with a digital content item and then controlling the presentation of that item in accordance with metadata-associated controls/constraints. The method may include determining a time-specific portion of a digital content item with which a user desires to associate a metadata item; associating the metadata item with the time-specific portion of the digital content item. During subsequent consumption of the digital content item by the user or another, the metadata item is presented synchronously in co lection with the time-specific portion of the digital content item, where such presentation is constrained or controlled in response to user-controlled filters implemented through a social network. | 2012-06-21 |
20120158756 | Searching in Peer to Peer Networks - Embodiments herein include a method and apparatus for searching a structured peer-to-peer (P2P) network. A requesting node obtains a search term and generates a Bloom filter using the search term. The Bloom filter is sent to a searching node, which compares the received Bloom filter with at least one further Bloom filter stored at a database accessible by the searching node. The further Bloom filter is associated a further node in the P2P network. In the event that the Bloom filter and the further Bloom filter match, the searching node sends towards the requesting node an identity of the further node. This allows the requesting node to query the further node for the required data. | 2012-06-21 |
20120158757 | Inherited Entity Storage Model - Techniques for an inherited entity storage model are described that can be employed to implement inherited entity management for a CRM system. In at least some embodiments, input can be obtained to create a custom entity that is based at least in part upon a parent entity. The custom entity is created to inherit the parent entity according to an inheritance relationship established between the entities. To do so, the custom entity is created from the parent entity in a common table with the parent entity using some common fields and defining custom fields as appropriate. Data for the entities is then stored via the common table. This approach can reduce storage requirements, enable unified searching, and speed up data operations. Further, back-end business logic associated with parent entity in the CRM system can be automatically applied to the custom entity based upon the inheritance relationship established between the entities. | 2012-06-21 |
20120158758 | Comparison device and method for comparing test pattern files of a wafer tester - A comparison device for comparing test pattern files of a wafer tester includes a storage unit and a processing unit. The comparison device stores a first to-be-compared file and a second to-be-compared file into the storage unit. The first to-be-compared file and the second to-be-compared file are text files respectively. The processing unit reads the first to-be-compared file and the second to-be-compared file from the storage unit to process and executes comparison operation, so as to generate a comparison result. The comparison operation is to compare the words in a first section of the first to-be-compared file with the words in a second section of the second to-be-compared file in a one-to-one manner. | 2012-06-21 |
20120158759 | INFORMATION PROCESSING DEVICE FOR SELECTING REAL ESTATE PROFESSIONALS - An information processing device includes a data base operable to receive first attribute data indicative of a plurality of real estate professionals and second attribute data indicative of a plurality of real estate properties. The information processing device includes a data processor in communication with the data base. The data processor includes application software having an algorithm operable for comparing the first and second attribute data and identifying matches therebetween. | 2012-06-21 |
20120158760 | METHODS AND COMPUTER PROGRAM PRODUCTS FOR PERFORMING COMPUTER FORENSICS - A method and computer program product for performing computer forensics using file identicality are provided. A file under investigation, or a content signature for the file under investigation, is received. A content signature watch registry is updated with the content signature of the file under investigation. Any information source clients that contain the content signature for the file under investigation are identified. Any information source clients that previously contained the content signature are also identified. When any new files are received, their content signatures are compared against the updated content signature watch registry and any matches are identified. For all information source clients and content signatures identified, a control action is initiated to either generate a file investigation report or a notification for an administrator of the system. | 2012-06-21 |