| 14th week of 2013 patent applcation highlights part 49 |
| Patent application number | Title | Published |
|---|
| 20130085999 | DISTRIBUTED COMPUTING BACKUP AND RECOVERY SYSTEM - The distributed computing backup and recovery (DCBR) system and method provide backup and recovery for distributed computing models (e.g., NoSQL). The DCBR system extends the protections from server node-level failure and introduces persistence in time so that the evolving data set may be stored and recovered to a past point in time. The DCBR system, instead of performing backup and recovery for an entire dataset, may be configured to apply to a subset of data. Instead of keeping or recovering snapshots of the entire dataset which requires the entire cluster, the DCBR system identifies the particular nodes and/or archive files where the dataset resides so that backup or recovery may be done with a much smaller number of nodes. | 2013-04-04 |
| 20130086000 | MANAGING BACK UP OPERATIONS FOR DATA - Backup operations for data resources can be managed as follows. At least one data resource residing on at least one data storage device is identified. An information processing system automatically determines that the at least one data resource fails to be associated with a backup policy. In response to the at least one data resource failing to be associated with a backup policy, at least one backup policy is associated with the at least one data resource. | 2013-04-04 |
| 20130086001 | AUTOMATIC FILE VERSION VERIFICATION WITHIN ELECTRONIC MAIL - A method can include determining metadata for a file responsive to initiating an operation on the file stored within a client system and determining a storage location within a file repository of a master version of the file from the metadata. The method also can include determining, from the storage location, whether the master version of the file is more recent than the file stored within the client system using a processor of the client system. | 2013-04-04 |
| 20130086002 | ENFORCING TEMPORAL UNIQUENESS OF INDEX KEYS UTILIZING KEY-VALUED LOCKING IN THE PRESENCE OF PSEUDO-DELETED KEYS - Techniques are described for identifying conflicts between a prospective temporal key and an index of temporal keys, the index sorted based on a time value associated with each of the temporal keys. Embodiments determine whether a first temporal key within the index of temporal keys conflicts with the prospective temporal key. Here, the keys within the index may be sorted based upon a respective time value associated with each of the keys. Upon determining that the first temporal key conflicts with the prospective temporal key, the prospective temporal key is designated as conflicting with at least one existing temporal key in the index of temporal keys. | 2013-04-04 |
| 20130086003 | MERGING PLAYLISTS FROM MULTIPLE SOURCES - The present technology resolves playlist version conflicts resulting from modifications made to a playlist version, stored on a client device and in a cloud locker, when the client device and the cloud locker are in a disconnected state. The present technology is a heuristic for determining how to resolve such version conflicts. Upon reconnection of the client and cloud locker, the server, associated with cloud locker attempts to reconcile any version discrepancies resulting from user-initiated changes. In one embodiment, when the server determines that one of the playlists on the client or server is a superset of the other, the superset is selected and saved to both the client and cloud locker, while the subset version is deleted. | 2013-04-04 |
| 20130086004 | UPDATING A PERFECT HASH DATA STRUCTURE, SUCH AS A MULTI-DIMENSIONAL PERFECT HASH DATA STRUCTURE, USED FOR HIGH-SPEED STRING MATCHING - A representation of a new rule, defined as a set of a new transition(s), is inserted into a perfect hash table which includes previously placed transitions to generate an updated perfect hash table. This may be done by, for each new transition: (a) hashing the new transition; and (b) if there is no conflict, inserting the hashed new transition into the table. If, however, the hashed new transition conflicts with any of the previously placed transitions, either (A) any transitions of the state associated with the conflicting transition are removed from the table , the hashed new transition is placed into the table, and the removed transitions are re-placed into the table, or (B) any previously placed transitions of the state associated with the new transition are removed, and the transitions of the state associated with the new transition are re-placed into the table. | 2013-04-04 |
| 20130086005 | HASH POINTER CHECKING FOR HIERARCHICAL DATABASE LOGICAL RELATIONSHIP - A method of checking consistency of pointers in a hierarchical database includes reading segment information recorded on the hierarchical database and determining a type of each segment and pointer included in each segment. The method also includes extracting parent pointers and twin pointers from child segments and extracting a child pointer from the parent segment. The method also includes calculating a first hash value b a combination of a storage location address of the parent segment and a value of the child pointer and a combination of the values of the parent pointers and the twin pointers included in the child segments, and a second hash value from a combination of storage location addresses of the child segments and the values of the parent pointers included in the child segments. The method further includes indicating a consistency error when the first hash value and the second hash value differ. | 2013-04-04 |
| 20130086006 | METHOD FOR REMOVING DUPLICATE DATA FROM A STORAGE ARRAY - A system and method for efficiently removing duplicate data blocks at a fine-granularity from a storage array. A data storage subsystem supports multiple deduplication tables. Table entries in one deduplication table have the highest associated probability of being deduplicated. Table entries may move from one deduplication table to another as the probabilities change. Additionally, a table entry may be evicted from all deduplication tables if a corresponding estimated probability falls below a given threshold. The probabilities are based on attributes associated with a data component and attributes associated with a virtual address corresponding to a received storage access request. A strategy for searches of the multiple deduplication tables may also be determined by the attributes associated with a given storage access request. | 2013-04-04 |
| 20130086007 | SYSTEM AND METHOD FOR FILESYSTEM DEDUPLICATION USING VARIABLE LENGTH SHARING - Embodiments of the present invention are directed to a method and system for filesystem deduplication that uses both small fingerprint granularity and variable length sharing techniques. The method includes accessing, within an electronic system, a plurality of files in a primary storage filesystem and determining a plurality of fingerprints for the plurality of files. Each respective fingerprint may correspond to a respective portion of a respective file of the plurality of files. The method further includes determining a plurality of portions of the plurality of files where each of the plurality of portions has the same corresponding fingerprint and accessing a list comprising a plurality of portions of files previously deduplicated. A portion of a file of the plurality of files not present in the list may then be deduplicated. Consecutive portions of variables lengths having the same corresponding fingerprints may also be deduplicated. | 2013-04-04 |
| 20130086008 | USE OF MAILBOX FOR STORING METADATA IN CONFLICT RESOLUTION - Metadata associated with contact unification, which may involve conflict resolution and de-duplication, is stored in a user's mailbox for optimizing future automated unification operations, sharing of information between different clients and services, and providing relational data that can be used for other applications. User interactions regarding unification such as rejection or acceptance of automated actions, usage of created unified contacts, as well as data from external applications and services may be analyzed and stored in the mailbox. Such metadata may then be used to resolve conflicts the same user or other users in future contact unification operations and shared with other applications and services through a predefined schema such that those applications and services can update their data as well. | 2013-04-04 |
| 20130086009 | METHOD AND SYSTEM FOR DATA DEDUPLICATION - The present disclosure discloses a method and system for data deduplciation. The method comprises: acquiring meta data and multiple data chunks corresponding to at least one original data object, which are generated by using a data deduplication method; combining the acquired multiple data chunks into a new data object; performing deduplication on the new data object to generate new meta data and new data chunks corresponding to the new data object; and storing the meta data corresponding to the at least one original data object, the new meta data corresponding to the new data object, and the new data chunks. The method and system can further improve deduplication ratio, lower data storage amount, and save costs. | 2013-04-04 |
| 20130086010 | SYSTEMS AND METHODS FOR DATA QUALITY CONTROL AND CLEANSING - A method for detecting and cleansing suspect building automation system data is shown and described. The method includes using processing electronics to automatically determine which of a plurality of error detectors and which of a plurality of data cleansers to use with building automation system data. The method further includes using processing electronics to automatically detect errors in the data and cleanse the data using a subset of the error detectors and a subset of the cleansers. | 2013-04-04 |
| 20130086011 | Associative Memory Visual Evaluation Tool - A method, apparatus, and non-transitory computer readable storage medium for validating content is provided. Data is parsed into at least a first group of data and a second group of data according to a plurality of types of content present in the data. The data is ingested into an associative memory. The associative memory forms a plurality of associations among the data. The associative memory is configured to be queried based on at least one relationship selected from a group consisting of direct relationships and indirect relationships among the data. The associative memory comprises a content-addressable structure, the content-addressable structure comprising a memory organization in which the data is configured to be accessed by the content as opposed to being configured to be accessed by addresses for the data. The first group of data and the second group of data are communicated in a graphical representation. | 2013-04-04 |
| 20130086012 | Methods, Systems and Computer Program Products for Providing a Distributed Associative Memory Base - Systems, methods and computer program products are provided for a distributed associative memory base. Such methods may include providing a distributed memory base that includes a network of networks of associative memory networks. The memory base may include a network of associative memory networks, a respective associative memory network comprising associations among a respective observer entity and a plurality of observed entities that are observed by the respective observer entity. Ones of the associative memory networks are physically and/or logically independent from other ones of the associative memory networks. Methods include imagining associations from the associative memory base using a plurality of streaming queues that correspond to ones of a plurality of rows of ones of the associative memory networks. | 2013-04-04 |
| 20130086013 | SYSTEM AND METHOD OF SAVING FILES TO A VERSION CONTROL SYSTEM ("VCS") REPOSITORY - A method of saving files to a version control system (“VCS”) repository located on a VCS server is provided. The VCS repository has at least two files. The method includes executing at least two processes by at least one server. The method includes creating a workspace for each of the at least two processes. The workspace corresponds to one of the at least two processes. The method includes saving a temporary version of at least one target file selected from the VCS repository to the workspace. Each of the at least two processes has the temporary version of the at least one target file saved to the workspace. The method includes committing the temporary version of the at least one target file back to the VCS repository. | 2013-04-04 |
| 20130086014 | NORMALIZING METADATA BETWEEN LIBRARY CONTENT PROVIDERS - Providing electronic library resources. A method includes obtaining metadata about one or more electronic library resources from a library resource publisher. The metadata defines locations of the library resources. The metadata is normalized to a standardized format appropriate for a plurality of library resource systems. | 2013-04-04 |
| 20130086015 | SYSTEM AND METHOD OF ROLLING UPGRADES OF DATA TRAITS - A method, article of manufacture, and apparatus for managing a computing environment, such as a cloud data repository. In some embodiments, this includes modifying an object or a component of an object at runtime and storing the modified object or modified component of an object in a storage device. In some embodiments, the component of an object modified may include traits. In some embodiments, objects or traits may have more than one version. | 2013-04-04 |
| 20130086016 | INTERFACE-ADAPTIVE DATA EXCHANGE - In embodiments, apparatuses, computer-readable media, and methods for interface-adaptive data exchange may be described. A sender and a receiver may communicate using different versions of a data exchange interface. A serializer may be configured to obtain data generated according to a first version of the data exchange interface and to write data to a communication medium for communication to the receiver such that it may be understood by the receiver based on the receiver's version of the data exchange interface. The serializer may be configured to omit one or ones of data that may be not be understood by the receiver based on the receiver's version of the data exchange interface. In some embodiments, the serializer may omit one or ones of data which are not permitted in the current context according to the interface definition. In various embodiments, the serializer may determine the extent of the omitted data based on an end delimeter, a length of data to-be-omitted, or a description of the sender's version of the data exchange interface. Other embodiments may be described. | 2013-04-04 |
| 20130086017 | GENERATING PROGRESSIVELY A PERFECT HASH DATA STRUCTURE, SUCH AS A MULTI-DIMENSIONAL PERFECT HASH DATA STRUCTURE, AND USING THE GENERATED DATA STRUCTURE FOR HIGH-SPEED STRING MATCHING - A multi-dimensional perfect hash table construction technique is based on which the well-known AC automaton, and can be implemented by very compact perfect hash tables. The technique may place transitions, each from a source state to a destination state, of an automaton into a hash table to generate a perfect hash table by: (a) dividing the transitions into multiple independent sets according to their respective source states; (b) ordering the sets of transitions based on the number of transitions belonging to the set, thereby defining an order of the sets from largest to smallest; and (c) constructing a perfect hash table by, for each of the sets of transitions, in the order from largest to smallest, hashing the transitions of the set into the hashing table to generate a perfect hashing table. | 2013-04-04 |
| 20130086018 | TRANSACTION PROCESSING SYSTEM, METHOD, AND PROGRAM - Using a KVS transaction processing mechanism, four lock states are managed. When a local transaction refers to and updates a map entry, the local transaction is graded up to a global transaction. Start processing as the global transaction is first performed to determine a transaction ID. A committed value, a value being updated, and a transaction ID being updated are then inserted into all map entries for which LX locks are being acquired at present. Another local transaction is then started for all map entries for which S locks are being acquired at present to acquire S locks. Next, the original local transaction is committed. As a result, the LX locks acquired are graded up to GX locks. After the termination of the global transaction as the waiting target, acquisition of S locks (GX locks) is tried as a global transaction. | 2013-04-04 |
| 20130086019 | SUBSTITUTE FUNCTION IN PROJECTION LIST - Techniques are disclosed for retrieving database data records using a request having a substitute clause. The substitute clause replaces a value stored in a predefined column with a new value while selecting the values of the plurality of columns in a projection list. In one embodiment, the database request may utilize a pre-defined syntax for a SELECT statement that supports a substitute clause having a form of: substitute(, ). | 2013-04-04 |
| 20130086020 | Interactive Web Application Framework - An interactive web application framework allows a user to define user interface and logic of a web application and publish the web application. A first application server can receive database data from a database server. The first application can process the database data to generate publication data. A second application server can receive the publication data from the first application server. The second application server can process the publication data to generate web data. The second application server can then send the web data to a web server for pushing to a web browser. | 2013-04-04 |
| 20130086021 | APPARATUS AND METHOD FOR CONTROLLING DATA ACCESS - A computer includes first and second storage devices where the first storage device stores first and second data and the second storage device stores the first data. The computer performs, on the first storage device, first access processing responsive to access requests to both of the first and second data. The computer performs, on the second storage device, a second access processing responsive to an access request to the first data, upon receiving an access request to the first data after performing the first access processing. | 2013-04-04 |
| 20130086022 | STORAGE TAPE ANALYTICS USER INTEFACE - A method of accessing tape storage analytics data gathered from tape libraries. The method includes generating a user interface on a client device via a web browser. The user interface includes a first screen displaying graphics or an analysis table generated based on the tape storage analytics data. The method includes receiving user input selecting a portion of the displayed graphics or an item within a cell of the analysis table and, then, modifying the user interface to display a second screen, which presents a subset of the tape storage analytics data corresponding to the selected portion and to operation of at least one of one or more tape libraries, one or more tape drives, and one or more tape media within the tape libraries. The receiving and modifying steps may be repeated to navigate between data corresponding to a tape library, a tape drive, and media. | 2013-04-04 |
| 20130086023 | CONTENT PROCESSING EXECUTION DEVICE, CONTENT PROCESSING EXECUTION METHOD, AND PROGRAMME - A content processing execution device receives an instruction of a processing execution of content, and acquires operation history information of the content corresponding to the instruction from an operation history information storage unit. The operation history information storage unit stores operation history information associated with an operation date and time of the content, an operation substance of the content, and an operation party of the content in accordance with the instruction of processing execution of the input content. Then, the content processing execution device acquires a life log corresponding to the operation substance of the operation history information from a life log storage unit that stores a life log corresponding to an operation substance of operation history information of the content based on the acquired operation history information; and present the acquired life log when the processing of the content is executed. | 2013-04-04 |
| 20130086024 | Query Reformulation Using Post-Execution Results Analysis - Systems, methods, devices, and media are described to facilitate the training and employing of a three-class classifier for post-execution search query reformulation. In some embodiments, the classification is trained through a supervised learning process, based on a training set of queries mined from a query log. Query reformulation candidates are determined for each query in the training set, and searches are performed using each reformulation candidate and the un-reformulated training query. The resulting documents lists are analyzed to determine ranking and topic drift features, and to calculate a quality classification. The features and classification for each reformulation candidate are used to train the classifier in an offline mode. In some embodiments, the classifier is employed in an online mode to dynamically perform query reformulation on user-submitted queries. | 2013-04-04 |
| 20130086025 | TECHNIQUES FOR RECEIVING AND PROCESSING ONE OR MORE USER-SPECIFIED QUERIES - Some embodiments of the invention provide techniques for receiving a query from a user of a mobile device, and for conveying to the user not only search results, but also feedback relating to query. For example, the user may be prompted to elicit supplemental information relating to the query, or provided other feedback. The feedback may be conveyed in a manner which minimizes how much of the mobile device's display screen is dedicated to presenting the feedback. | 2013-04-04 |
| 20130086026 | TECHNIQUES RELATING TO RECEIVING AND PROCESSING USER-SPECIFIED QUERIES - Some embodiments of the invention provide techniques for receiving a query from a user of a mobile device, and for conveying to the user not only search results, but also feedback relating to query. For example, the user may be prompted to elicit supplemental information relating to the query, or provided other feedback. The feedback may be conveyed in a manner which minimizes how much of the mobile device's display screen is dedicated to presenting the feedback. | 2013-04-04 |
| 20130086027 | TECHNIQUES FOR THE RECEIPT AND PROCESSING OF USER-SPECIFIED QUERIES - Some embodiments of the invention provide techniques for receiving a query from a user of a mobile device, and for conveying to the user not only search results, but also feedback relating to query. For example, the user may be prompted to elicit supplemental information relating to the query, or provided other feedback. The feedback may be conveyed in a manner which minimizes how much of the mobile device's display screen is dedicated to presenting the feedback. | 2013-04-04 |
| 20130086028 | RECEIVING AND PROCESSING USER-SPECIFIED QUERIES - Some embodiments of the invention provide techniques for receiving a query from a user of a mobile device, and for conveying to the user not only search results, but also feedback relating to query. For example, the user may be prompted to elicit supplemental information relating to the query, or provided other feedback. The feedback may be conveyed in a manner which minimizes how much of the mobile device's display screen is dedicated to presenting the feedback. | 2013-04-04 |
| 20130086029 | RECEIPT AND PROCESSING OF USER-SPECIFIED QUERIES - Some embodiments of the invention provide techniques for receiving a query from a user of a mobile device, and for conveying to the user not only search results, but also feedback relating to query. For example, the user may be prompted to elicit supplemental information relating to the query, or provided other feedback. The feedback may be conveyed in a manner which minimizes how much of the mobile device's display screen is dedicated to presenting the feedback. | 2013-04-04 |
| 20130086030 | METHOD FOR SEARCH ENGINES TO RANK FORUMS AND DISCUSSION BOARDS - A search engine method, performed by one or more server devices, for improving relevancy in ranking search results for forums and discussion boards. In one aspect of the invention, the method weights selected posts using one or more parameters for forums and discussion boards, where a post to a forum or a discussion board has certain properties that are typically associated with forums and discussion boards. Unlike, other methods, the disclosed method is largely content driven, and the method drills down to estimate relevancy, and the posts properties are analyzed to as to how much they should contribute to the ranking. | 2013-04-04 |
| 20130086031 | MAXIMIZING CONTENT ITEM INFORMATION ON A SEARCH ENGINE RESULTS PAGE - Methods, computer systems, and computer-readable storage media for maximizing information associated with content items on a search engine results page are provided. A total number of pixels available on the search engine results page is determined, and content items are received in response to a search query. Templates are selected from a set of pre-generated templates, and the content items are initially assigned to the templates such that a number of content items is maximized on the search engine results page. Next, and starting with the highest-ranked content item, an optimal size is determined for each of the templates such that the content-item-per-pixel is maximized within each template. After resizing the templates to the optimal size, the content items are presented on the search engine results page. | 2013-04-04 |
| 20130086032 | SYSTEM AND METHOD FOR PRIOR ART ANALYTICS AND MAPPING - A computer-implemented method and system are provided for monitoring developments in a field of prior art. The method comprises using one or more processors receive a search query including a first patent concept related to the field of prior art; search the Internet as a function of the search query; generate a first set of search results; store the first set of search results in a database; conduct a subsequent search on the Internet as a function of the search query; generate a second set of search results; compare the first and second sets of search results to identify differences in the results; and communicate the differences to a user. An ontology of patent concepts may be stored in a system database. The searches may be conducted automatically on a regular basis thereby notifying the user of any intervening changes in the field of prior art. | 2013-04-04 |
| 20130086033 | SYSTEMS, METHODS AND USER INTERFACES IN A PATENT MANAGEMENT SYSTEM - A prior art date analyzer system and method are provided. The system comprises a search engine to retrieve data from an external patent database, the data including at least one priority date for a patent matter stored in the database. The system further comprises an analytics module to receive input identifying national prior art rules, analyze the retrieved data to identify criteria relevant to the rules, and determine automatically the likely effective date of the reference. | 2013-04-04 |
| 20130086034 | METHOD AND SYSTEM TO PROCESS A DATA SEARCH REQUEST - Example systems and methods of processing a data search request are presented. In one example, a data search request including a plurality of constraints is received. Each of the plurality of constraints is of one of a plurality of constraint types. At least one of the plurality of constraints of a first constraint type is expanded to one or more constraints of at least one other constraint type. A plurality of search definitions is formulated utilizing the plurality of constraints. Each of the plurality of search definitions includes a unique constraint set excluding at least one of the plurality of constraints. A plurality of searches is performed using the plurality of search definitions to generate a plurality of search results. Data item counts corresponding to the search definitions are calculated. The data item counts and the corresponding search definitions are communicated to a client machine. | 2013-04-04 |
| 20130086035 | METHOD AND APPARATUS FOR GENERATING EXTENDED PAGE SNIPPET OF SEARCH RESULT - A method and apparatus for generating an extended page snippet in a search engine. The method includes: retrieving and returning an associated table webpage having a table related to an inquired keyword; obtaining a parsed result of the table in the associated table webpage, and extracting column names and respective row instances on the basis of the parsed result; determining the row instances related to the inquired keyword; and generating a page snippet in a table style in accordance with the column names and the relative row instances. The page snippet in the table style can be generated by using a solution of the present invention. | 2013-04-04 |
| 20130086036 | Dynamic Search Service - Textual information processed by an application may be used to access data from one or more on-line data source (e.g., Wikipedia) which may be used to enhance the user experience or to improve user productivity from using the application. One such application may be a search service that accesses such data based on input data provided to the application. For example, the application may parse instant messages sent and received by a user to extract keywords, phrases or links, which are then used to retrieve information from a repository of data obtained form various data sources. In this manner, data related to the subject matters of the user's communication may be readily accessed by the user, if desired, in a convenient manner To deliver real time performance, the repository of data may be pre-processed (e.g., indexed) to facilitate information retrieval. | 2013-04-04 |
| 20130086037 | ENCAPSULATED, MODEL-CENTRIC AGGREGATION OF DATA FROM DIFFERENTIATED DATA SOURCES - A reusable ERP data retrieval object, in particular, a wide application query object provides a systematic and standardized approach to data retrieval. In one embodiment, the wide application query object is an encapsulated query object in that multiple queries are aggregated into one master query object (i.e., the wide application query object) that can, but does not necessarily have to, span multiple disparate data sources. In another embodiment, data retrieved in accordance with the wide application query logic is manipulated by code in any of a variety of different ways using a trigger model and specialized constructs. In still another embodiment, public parameters are utilized to trigger functions that impact the substance and layout of the query output. | 2013-04-04 |
| 20130086038 | PROVISION OF INDEX RECOMMENDATIONS FOR DATABASE ACCESS - A cost estimator may estimate execution costs for execution of at least one query against a database, using at least one existing index, if any, and based on estimation criteria determined from analyzing the query execution. A candidate index provider may provide candidate indexes, based on the estimation criteria, and re-estimate the execution costs to obtain updated execution costs, using the candidate indexes. An index recommender may recommend a recommended index, based on the updated execution costs. | 2013-04-04 |
| 20130086039 | REAL-TIME SECURITY MODEL PROVIDING INTERMEDIATE QUERY RESULTS TO A USER IN A FEDERATED DATA SYSTEM - The subject technology provides configurations for receiving a query for data stored across data systems in which the query is associated with a user. It is determined if the user has permission to execute an operation from the query at a data in which the operation is executed upon at least one table provided by the data system. The subject technology determines if the operation corresponds to a cache object in a cache registry if the user has permission. Each cache object is owned by a cache manager user. A view associated with the user is created that provides temporary access privileges to the cache object corresponding to the operation in which the cache object includes results of the operation executed in the query and the cache object is owned by the cache manager user. The results of the operation are then provided in the created view to the user. | 2013-04-04 |
| 20130086040 | SYSTEMS AND METHODS FOR DYNAMIC ON-GOING DECISION SUPPORT AND TRENDING BASED ON A FLEXIBLE DATA MODEL - Certain examples provide systems, methods, apparatus, and articles of manufacture for clinical data analysis. Certain examples provide a clinical data analysis system including a user interface, a task manager, and a process manager. The example user interface is to facilitate user input and provide output to the user regarding a data query and analysis. The example task manager is to create and manage one or more analyzers to identify at least one of a trend and a correlation in query results. The example process manager is to facilitate querying of one or more data sources according to the data query and a flexible data model, the process manager to allocate tasks to the one or more analyzers for the data query and analysis. The example process manager and task manager are to facilitate user queries and automated system queries performed automatically during periods of non-peak usage. | 2013-04-04 |
| 20130086041 | USE OF OFF-PAGE CONTENT TO ENHANCE CAPTIONS WITH ADDITIONAL RELEVANT INFORMATION - Architecture that uses content from off-page data sources such as feeds (e.g., yellow pages, coupons, social networks, commerce, etc.) to present additional, relevant information in association with search results. The additional and relevant information is directly relevant to the implicit task the user is trying to accomplish. The architecture includes online and offline mechanisms that identify an entity represented on a web page and look-up information related to that entity in disparate data sources. Relevance heuristics are employed to determine which of the available entity data to show in the caption given the user query, the web page, and the underlying user task (other known information about the user such as geographic location). | 2013-04-04 |
| 20130086042 | SYSTEM AND METHOD FOR INFORMATION DISCLOSURE STATEMENT MANAGEMENT AND PRIOR ART CROSS-CITATION CONTROL - The present inventive subject matter relates to document management, more particularly to a system and method for information disclosure statement management and prior art cross-citation control. Various embodiments of the present inventive subject matter include systems and methods for controlling the cross-citation and propagation of prior art reference documents from one patent case to another. Some embodiments may include propagation control user interfaces which display to a user sets of patent cases as potential target cases for prior art. In some embodiments, characteristics of the prior art may be identified and used as the basis for selecting and controlling the cross-citation of prior art. | 2013-04-04 |
| 20130086043 | SYSTEM AND METHOD FOR TRACKING PATENT OWNERSHIP CHANGE - A computer-implemented method and system are provided for automatically tracking change in ownership status of patents listed in a database at a patent registry. The method comprises receiving input from a user identifying one or more patents of interest to be tracked and, based on the input received, automatically performing a search of the registry database to identify changes in ownership status for any one or more of the patents of interest. The search results are formatted and transmitted to a user. The automatic search may be conducted on a regular basis thereby notifying as user of any intervening changes in ownership. | 2013-04-04 |
| 20130086044 | SYSTEM AND METHOD FOR PATENT ACTIVITY PROFILING - A computer-implemented method and system are provided for profiling patent activity for a user. The patent activity may be competitive patent activity. The method comprises retrieving a first set of data from a database or patent registry relating to one or more patent matters in the name of a user-specified applicant, owner, or owner type and generating a first patent activity profile for the applicant, owner or owner type based on the retrieved data. The first patent activity profile is stored in a database as a reference profile. The method includes retrieving a second set of data from a database or patent registry relating to the one or more patent matters in the name of the specified applicant, owner, or owner type and comparing the first and second sets of data to identify deviations from the reference profile. The identified deviations are transmitted to the user. | 2013-04-04 |
| 20130086045 | PATENT MAPPING - System and method permit patent mapping. A method may comprise maintaining a database of patent portfolios and a database of patents with each patent stored in the database of patents associated with one or more patent portfolios stored in the database of patent portfolios. A target subject matter to be mapped is identified and a search query associated with the target subject matter is received. Search results are generated to define a first patent portfolio in the database with the search results including one or more patent claims associated with the search query. The one or more patent claims are mapped to a patent concept. | 2013-04-04 |
| 20130086046 | PATENT MAPPING - A system and computer implemented method are provided. The method comprises maintaining a database of patent portfolios and a database of patents, with each patent stored in the database of patents being associated with one or more patent portfolios stored in the database of patent portfolios. The method includes receiving a search query associated with a first patent portfolio; searching the first portfolio as a function of the search query; generating a seed set of search results including one or more patent claims associated with the search query, the patent claims including terms from the search query; automatically generating an expanded set of search results including one or more patent claims further associated with the search query or associated with the patent claims in the seed set of search results; and mapping the one or more patent claims to a patent concept. | 2013-04-04 |
| 20130086047 | PATENT MAPPING - A system and computer implemented method of patent mapping are provided. The method comprises maintaining a database of patent portfolios and a database of patents, each patent stored in the database of patents associated with one or more patent portfolios stored in the database of patent portfolios; maintaining a database of ontologies, the ontologies including one or more patent concepts in defined groups; receiving a search query associated with a first patent portfolio; searching the first portfolio as a function of the search query; generating search results, the search results including one or more patent claims associated with the search query; and mapping the one or more patent claims to a patent concept in a defined group. | 2013-04-04 |
| 20130086048 | PATENT MAPPING - A system and computer implemented method of patent mapping is provided. The method comprises maintaining a database of patent portfolios and a database of patents, each patent stored in the database of patents associated with one or more patent portfolios stored in the database of patent portfolios; receiving a search query associated with a first patent portfolio; searching the first portfolio as a function of the search query; generating search results, the search results including one or more independent patent claims associated with the search query; mapping the one or more independent patent claims to at least one patent concept; and associating the at least one mapped patent concept to one or more patent claims which are dependent on the one or more independent patent claims. | 2013-04-04 |
| 20130086049 | PATENT MAPPING - A system and method for patent mapping are provided. The system comprises a database of patent sets and a database of patents, each patent stored in the database of patents associated with one or more patent sets stored in the database of patent sets; and one or more modules to perform a portion of one or more of the following: receive input identifying a set of keyword source claims associated with a first patent set; automatically extract at least one keyword from the source claims; receive or formulate a search query associated with the first patent set, the search query including the at least one keyword; search the entire first patent set as a function of the search query; generate search results, the search results including one or more patent claims associated with the search query; and map the one or more patent claims to a patent concept. | 2013-04-04 |
| 20130086050 | SYSTEM AND METHOD FOR PRIOR ART ANALYSIS - The present inventive subject matter relates to prior art analysis. Various embodiments of the present inventive subject matter include systems and methods for analyzing prior art in a patent portfolio and annuity management system. In an example embodiment, a method comprises maintaining a patent matter database and a database of prior art documents including data about the prior art documents such as the priority or publication dates of the documents. A keyword analysis is performed on a given patent matter and associated prior art documents to identify keywords occurring uniquely in the first patent matter as potential claim elements differentiating the patent matter over the disclosures contained in the one or more prior art documents. | 2013-04-04 |
| 20130086051 | LOGGING EVENTS IN MEDIA FILES INCLUDING FRAME MATCHING - Comparing images, including: selecting a target image; selecting one or more search images; comparing the target image to a negative image corresponding to each search image to generate an image comparison score for each search image; and identifying the search image with the best image comparison score. Keywords include logging events and frame matching. | 2013-04-04 |
| 20130086052 | Method and System of Information Matching in Electronic Commerce Website - Techniques for sorting search results using user characteristic data are described. These techniques may include receiving a query from a user device. A search may be performed based on the query to obtain multiple results. User responses corresponding to the multiple results may be obtained and then grouped to determine multiple users based on similarities among the multiple users. Based on user responses associated with the multiple users, the multiple results may then be ranked. | 2013-04-04 |
| 20130086053 | Personalized Meta-Search Method and Application Terminal Thereof - The disclosure discloses a personalized meta-search method, which comprises: preestablishing an interest database; searching a keyword; extracting a use log of the keyword from the interest database; preprocessing search results returned from a search engine; calculating, by using the use log, interests of the preprocessed search results and of Uniform Resource Locators (URLs) in the interest database corresponding to the searched keyword; ranking, based on calculated results, and displaying the preprocessed search results and the URLs; updating the interest database. An application terminal for personalized meta-search is also disclosed. The method and the application terminal enable users to obtain more targeted and more satisfactory search results, thereof improving user experience. | 2013-04-04 |
| 20130086054 | CONCURRENT CALCULATION OF RESOURCE QUALIFICATION AND AVAILABILITY USING TEXT SEARCH - A system, for concurrent calculation of resource qualifications (e.g., skills, educational degree, etc) and availability (e.g., availability to work on a project) using text search. The method commences by initiating a flow for requesting resources, the resource request comprising a qualification requirement indication and a time period requirement indication. The method further comprises retrieving candidate resource documents in a manner so as to calculate an overall match score that is based not only on qualifications, but also on availability. The scoring uses a recoded candidate resource document that comprises qualification attributes as well as time period availability to form an overall match score. The recoding can be performed in an administrative flow (e.g., a batch process, and/or a periodically executed update process), and the administrative flow creates recoded candidate resource document that are suited for use with a text search engine capable of processing an extensible markup language document. | 2013-04-04 |
| 20130086055 | APPARATUS AND METHOD FOR SEARCHING WITH CONSIDERATION USER'S ACTION - A method searches web objects. The method includes calculating a user rank for at least one web object based on a user's action and determining a listing order of at least one found web object using the user rank. | 2013-04-04 |
| 20130086056 | GESTURE BASED CONTEXT MENUS - Methods, systems, and techniques for providing context menus based upon gestured input are provided. Example embodiments provide a Gesture Based Context Menu System, which enables a gesture-based user interface to invoke a context menu to present one or more choices of next actions and/or entities based upon the context indicated by the gestured input and a set of criteria. In overview, the GBCMS allows an area of electronically presented content to be dynamically indicated by a gesture and then examines the indicated area in conjunction with a set of criteria to determine and present a context menu of further choices available to the user. The choices may be presented in the form of, for example, a pop-up menu, a pull-down menu, an interest wheel, or a rectangular or non-rectangular menu. In some embodiments the menus dynamically change as the gesture is modified. | 2013-04-04 |
| 20130086057 | SOCIAL NETWORK RECOMMENDED CONTENT AND RECOMMENDING MEMBERS FOR PERSONALIZED SEARCH RESULTS - Architecture that provides a data structure to facilitate personalized ranking over recommended content (e.g., documents). The data structure approximates the social distance of the searching user to the content at query time. A graph is created of content recommended by members of the social network, where the nodes of the graph include content nodes (for the content) and recommending member nodes (for members of the social network who recommended the content). If a member recommends content, an edge is created between the member node and the content node. If a member is a “friend” (tagged as related in some way) of another member, an edge is created between the two member nodes. Each node is converted to a lower dimensional feature set. Feature sets of the content are indexed and the feature set of the searching user is utilized to match and rank the search results at query time. | 2013-04-04 |
| 20130086058 | Synonym Groups - A computer-implemented method includes receiving a search query that includes a user specified search criteria directed toward one field of a plurality of fields associated with a synonym group, and performing a search of a database of a scientific data information system based on the search query. In addition to the user specified search criteria, the search includes all of other the fields associated with the defined synonym group. | 2013-04-04 |
| 20130086059 | Method for Discovering Key Entities and Concepts in Data - A method of automatically processing text data is described. An initial set of data tags is developed that characterize text data in a text database. Higher order entities are determined which are characteristic of patterns in the data tags. Then the text data is automatically tagged based on the higher order entities. | 2013-04-04 |
| 20130086060 | PRIVILEGED ACCOUNT MANAGER, MANAGED ACCOUNT PERSPECTIVES - Techniques for managing accounts are provided. An access management system may check out credentials for accessing target systems. For example a user may receive a password for a period of time or until checked back in. Access to the target system may be logged during this time. Upon the password being checked in, a security account may modify the password so that the user may not log back in without checking out a new password. Additionally, in some examples, password policies for the security account may be managed. As such, when a password policy changes, the security account password may be dynamically updated. Additionally, in some examples, hierarchical viewing perspectives may be determined and/or selected for visualizing one or more managed accounts. Further, accounts may be organized into groups based on roles, and grants for the accounts may be dynamically updated as changes occur or new accounts are managed. | 2013-04-04 |
| 20130086061 | IMPLEMENTING SERVICE ORIENTED ARCHITECTURE INDUSTRY MODEL REPOSITORY USING SEMANTIC WEB TECHNOLOGIES - A plurality of topic maps are stored in one or more storage devices. Each of the topic maps represents information using topics, associations, and occurrences. Each of the topic maps provides meta data for assets stored in an asset repository. A computer provides one or more services over a network. At least one of the one or more services enables functionality of one or more user interfaces. The one or more services provide semantic search functionality for the assets of the asset repository. The semantic search functionality utilizes the topics, associations, and occurrences of one or more of the topic maps to find one of more of the assets of the asset repository that satisfies conditions input via one of the one or more user interfaces. | 2013-04-04 |
| 20130086062 | METHOD AND SYSTEM FOR THE MANAGEMENT OF PROFESSIONAL SERVICES PROJECT INFORMATION - A method and system are provided for the transfer and/or aggregation of data and, in particular, integrating data used in managing a professional services practice. The invention preferably transfers and/or aggregates data relating to the identity of clients and matters for whom professional services are being rendered with data relating to the work which data may be maintained in inconsistent, proprietary formats, comprising one or more of the following types of information: accounting: budgeting; docketing; time and billing: work product; word processing; records; project management; and/or other information relating to the professional services. The system of the present invention preferably comprises data storage and data processing means adapted to use the data in substantially portable and/or application-independent format, and/or and transfer or aggregate data between common, and/or proprietary data formats. | 2013-04-04 |
| 20130086063 | Deriving User Influences on Topics from Visual and Social Content - Analyzing digital content associated with a entity to identifier the entity's interest and influence related thereto. A set of digital content, such as text, pictures, or video, which the entity has submitted to one or more social media services, is identified. A set of interests for the entity is identified. This may be performed, in part, by analyzing a set of pictures to identify a set of visual attributes for each picture. Then, one or more descriptive labels that characterize the content shown in each picture are determined based on the set of visual attributes for each picture. Next, one or more subject categories for each picture are determined based upon the one or more descriptive labels for each picture. Thereafter, a set of actual interests for the entity is identified based, at least in part, upon the one or more subject categories associated with each digital picture. | 2013-04-04 |
| 20130086064 | SPREADSHEET BASED DATA STORE INTERFACE - A computer-implemented method for exploring external data sources includes selecting a first function from a function library in a spreadsheet application based on a first user input, designating a first data source for the first function based on a second user input, wherein the first data source comprises a first dataset stored externally to the spreadsheet application, and arranging a first cell formula comprising the first function and a first identifier for the first data source in a first cell of a spreadsheet. The method further includes selecting an output function from the function library based on a third user input, designating a source function's reference based on a fourth user input, designating an output location in the spreadsheet based on a firth user input, and arranging a second cell formula including the selected output function, the designated source function's reference and the designated output location in a second cell of the spreadsheet. The method further includes translating the first cell formula contained in the first cell referenced as the source function to the output function into a data query for a data engine in response to a refresh action and sending the data query to the data engine, wherein the data engine is configured to execute the data query against the first dataset. | 2013-04-04 |
| 20130086065 | PRIVILEGED ACCOUNT MANAGER, DYNAMIC POLICY ENGINE - Techniques for managing accounts are provided. An access management system may check out credentials for accessing target systems. For example a user may receive a password for a period of time or until checked back in. Access to the target system may be logged during this time. Upon the password being checked in, a security account may modify the password so that the user may not log back in without checking out a new password. Additionally, in some examples, password policies for the security account may be managed. As such, when a password policy changes, the security account password may be dynamically updated. Additionally, in some examples, hierarchical viewing perspectives may be determined and/or selected for visualizing one or more managed accounts. Further, accounts may be organized into groups based on roles, and grants for the accounts may be dynamically updated as changes occur or new accounts are managed. | 2013-04-04 |
| 20130086066 | AUTOMATED DISCOVERY AND GENERATION OF HIERARCHIES FOR BUILDING AUTOMATION AND CONTROL NETWORK OBJECTS - Management systems, methods, and mediums. A method includes identifying a name of a first object in a plurality of objects. The plurality of objects is associated with one more devices communicably connected to a building automation and controls network. The method includes parsing characters in the name of the first object to identify a plurality of name segments separated by one or more delimiters in the name in response to identifying the one or more delimiters. The method includes identifying a type of the first object and a location of a first device associated with the first object based on the plurality of name segments. Additionally, the method includes generating a hierarchical structure for the plurality of objects based on the type and the location, the hierarchical structure comprising a name for each of the plurality of objects. | 2013-04-04 |
| 20130086067 | CONTEXT-AWARE SUGGESTIONS FOR STRUCTURED QUERIES - A suggestion system for providing suggestions of features for inclusion in a clause of a structured query. The suggestion system receives a partial query that is being created by a user. The suggestion system analyzes a query log having queries submitted by one or more users to identify features to suggest to the user based on a likelihood that users who submitted queries similar to the partial query included that feature in the query. The query system then presents to the user the identified features as suggestions to include in the partial query. | 2013-04-04 |
| 20130086068 | METHOD OF VISUALIZING THE COLLECTIVE OPINION OF A GROUP - A computerized method of visualizing the collective opinion of a group regarding one or more qualitative issues. The group initially selects N issues from the universe of potential issues and often assigns the issues images and titles. The system presents each user with graphical user interface screens wherein individual users vote on the relative importance and degree of relationship between the N aspects (Data Points) and issues, often using drag and drop methods. The software computes N×N similarity matrices based on users voting input and clusters various aspects into groups of greater and lesser similarity and importance, and presents results of users qualitative ranking in easy to read relationship tree diagrams where the relative importance and qualitative relationship of the issues may be designated by size and other graphical markers. The software may reside on a network server and present display screens to web browsers running on user's computerized devices. | 2013-04-04 |
| 20130086069 | SYSTEMS, METHODS, AND APPARATUS FOR COMPUTER-ASSISTED FULL MEDICAL CODE SCHEME TO CODE SCHEME MAPPING - An example method for mapping of medical code schemes includes processing a plurality of coded concepts to determine a potential match between a code from a first code scheme in the plurality of coded concepts and a code from a second code scheme in the plurality of coded concepts. The method includes assigning a probability to each potential match of a code from the first code scheme and a code from the second code scheme. The method includes generating an alphanumeric indication of the probability of each potential match between the first code scheme and the second code scheme from the plurality of coded concepts and generating a graphical representation of the plurality of coded concepts. The method includes outputting the alphanumeric indication and the graphical representation to a user and accepting user input to select a match between the first code scheme and the second code scheme. | 2013-04-04 |
| 20130086070 | PRIOR ART MANAGEMENT - System and method permit prior art management. A method may comprise maintaining a database of patent portfolios and a database of patents with each patent stored in the database of patents associated with one or more patent portfolios stored in the database of patent portfolios. A method and system of prior art management may include maintaining a database of prior art portfolios, a database of patent matters, and a database of prior art reference citations, at least some of the prior art reference citations being associated with at least one of the patent matters stored in the database. Prior art references may be cross-cited between patent matters and portfolios. | 2013-04-04 |
| 20130086071 | AUGMENTING SEARCH WITH ASSOCIATION INFORMATION - Techniques and tools are described for augmenting search using association information. Searches can be performed using a combination of index information and association information. In some examples, index information is stored in a first data store and association information is stored in a second data store. Search queries can be received and modified using association information. Modified search queries can be executed using a combination of index information and association information. Index information can be generated by indexing a set of documents. Association information can be generated by monitoring user activity occurring between users and a set of documents. | 2013-04-04 |
| 20130086072 | METHOD AND SYSTEM FOR EXTRACTING AND CLASSIFYING GEOLOCATION INFORMATION UTILIZING ELECTRONIC SOCIAL MEDIA - Methods, systems and processor-readable media for extracting and classifying location information utilizing social media messages and/or data thereof. The social media messages can be sampled from a social media database and the messages filtered based on a heuristic rule. A geolocation entity from the unstructured social media messages can be extracted utilizing a geolocation entity extracting module. The messages with the geoentities can be uploaded onto a crowd sourcing platform to manually annotate the messages with a label. A text classification model can be built and learned from the label utilizing a machine learning algorithm and the messages can be classified by a location classifier in order to extract the user location. The user location can then be transformed into a geocode so that a spatial search can be enabled and the distance between the locations can be easily calculated. | 2013-04-04 |
| 20130086073 | REJECTING ROWS WHEN SCANNING A COLLISION CHAIN - Provided are techniques for rejecting rows while locating a target row. For a row that is stored in a hash space, a row filter value is generated for that row, and the row filter value is stored with the row. While trying to locate the target row in a collision chain in the hash space, a row filter value is calculated for the target row. For the row in the collision chain, the stored row filter value of the row in the collision chain is compared with the computed row filter value of the target row. In response to determining that the stored row filter value does not match the computed row filter value, it is determined that the row in the collision chain is not the target row. | 2013-04-04 |
| 20130086074 | EXTENDED WIDTH ENTRIES FOR HASH TABLES - A hash table supports extended entries. The extended entries permit a base entry to extend its associated data into one or more neighboring entries. Extended entries thereby provide a mechanism through which a hash table entry may store additional data compared to a base entry. Extended entries may coexist with base entries in the hash table. The hash table thereby provides the flexibility to adapt dynamically to meet system requirements and to balance the needs of additional data storage by blending the number of extended entries (that each store more data than a base entry) and the number of base entries (each storing less data than an extended entry). | 2013-04-04 |
| 20130086075 | Methods and Systems for Providing Unique Signatures - Presented are systems and methods for creating a set of signatures including acquiring a data set and converting the data set into a plurality of data matrices. The system determines a prime number and determines a plurality of primitive roots to the prime number. The system calculates a template matrix using a first and second primitive root, of the plurality of primitive roots, and selects a data matrix property of interest. The system calculates a first hash function for each of the data matrices to create a first signature for each data matrix such that a main set of signatures is formed, wherein the first hash function is calculated using said property of interest, the prime number, and the template matrix. The system generates a main set of signatures based on the first hash functions, wherein the main set of signatures comprises a first signature for each data matrix. | 2013-04-04 |
| 20130086076 | REFINEMENT AND CALIBRATION MECHANISM FOR IMPROVING CLASSIFICATION OF INFORMATION ASSETS - Techniques are described for refining the manual classification of assets classified or categorized using the terms of a business glossary. A semantic refinement mechanism is used to refine the manual classification of such assets, as well as subsequently evaluate the refined asset classifications. Further, the refined asset classifications may be used as a training set for a machine learning classifier. That is, should the classification of an asset contributing to a refinement change, the refinement based on that classification may be undone, at least in some cases. | 2013-04-04 |
| 20130086077 | Method and Apparatus for Associating Commenting Information with One or More Objects - An approach is provided for presenting a user interface and associating one or more commenting information with on one or more content items detected in one or more media items. Further, a user may associate one or more commenting information related to a point of interest/object wherein one or more content items associated with the point of interest/object may be retrieved and aggregated with the one or more commenting information. | 2013-04-04 |
| 20130086078 | SYSTEM AND METHOD FOR GENERATION OF A DYNAMIC SOCIAL PAGE - The present disclosure includes methods and systems for dynamically rendering a social page of the user based on the visiting user's interests. When a visiting user visits another user's social page, the visiting user will be presented with information from the user's social page related to interests for which the visiting user has exhibited an interest. | 2013-04-04 |
| 20130086079 | GRAPHICAL USER INTERFACE FOR INTERACTING WITH AUTOMATICALLY GENERATED USER PROFILES - A robust knowledge-based management and sharing system organized by context for context-based searching and retrieval of relevant information is disclosed. The described embodiments and techniques are used to automatically generate user profile data and organize it around one or more contexts associated with users such as their projects, products, or customers; or around users' expertise such as their competencies, knowledge, and experience. At least certain embodiments include a graphical user interface that is configured to display the automatically generated user profiles categorized based on a given expertise or context associated with the end-user. | 2013-04-04 |
| 20130086080 | SYSTEM AND METHOD FOR INFORMATION DISCLOSURE STATEMENT MANAGEMENT AND PRIOR ART CROSS-CITATION CONTROL - The present inventive subject matter relates to document management, more particularly to a system and method for information disclosure statement management and prior art cross-citation control. Various embodiments of the present inventive subject matter include systems and methods for controlling the cross-citation and propagation of prior art reference documents from one patent case to another. Some embodiments may include propagation control user interfaces which display to a user sets of patent cases as potential source documents of prior art. In some embodiments, characteristics of the prior art may be identified and used as the basis for selecting and controlling the cross-citation of prior art. | 2013-04-04 |
| 20130086081 | DYNAMIC CLIENT SIDE NAME SUGGESTION SERVICE - A method for providing Internet domain name suggestions includes parsing a web page; obtaining at least one keyword from the parsing, generating a first query from the at least one keyword; and determining, based at least on the first query, if at least one name suggestion is available. The method also includes, if at least one name suggestion is available, generating at least one domain name suggestion based at least on the first query and displaying the at least one domain name suggestion. | 2013-04-04 |
| 20130086082 | METHOD AND SYSTEM FOR PROVIDING PERSONALIZATION SERVICE BASED ON PERSONAL TENDENCY - A personalization recommendation service providing method and system, based on a personal tendency provides a personally targeted recommendation list by re-ranking a candidate recommendation list obtained through a predetermined recommendation technique, by acquiring a user tendency profile and the candidate recommendation list, re-ranking the candidate recommendation list according to the user tendency profile, and generating the targeted recommendation list based on recommendation contents by the re-ranking of the candidate recommendation list. | 2013-04-04 |
| 20130086083 | TRANSFERRING RANKING SIGNALS FROM EQUIVALENT PAGES - Methods, computer systems, and computer-storage media for transferring ranking signals from equivalent pages to master pages are provided. In embodiments, ranking signals are received. Documents are determined to be equivalent pages. Master pages for the equivalent pages are identified. The ranking signals are transferred to the master pages. | 2013-04-04 |
| 20130086084 | PATENT MAPPING - A method of patent mapping comprises maintaining a database of patent portfolios and a database of patents, each patent stored in the database of patents associated with one or more of the patent portfolios; receiving a search query associated with a first patent portfolio; searching the first portfolio as a function of the search query; generating search results, the search results including one or more patent claims associated with the search query; generating a claim similarity index for at least one patent claim or portion thereof included in the search results, based on its similarity to at least one other patent claim or portion thereof in the search results; identifying, based on the similarity index, one or more patent claims included in the search results as primary targets to map a patent scope to; and mapping the one or more patent claims to the patent concept. | 2013-04-04 |
| 20130086085 | COMPUTER PRODUCT, ANALYSIS SUPPORT METHOD, ANALYSIS SUPPORT APPARATUS, AND SYSTEM - A computer-readable recording medium has stored therein a program for causing a computer to execute an analysis support process that includes storing to a storage device, a name of a second process that is a process included among a plurality of processes called in response to execution of a program, the computer storing the name of the second process when a first process having a name that matches a keyword stored in a storage device is included among the processes. | 2013-04-04 |
| 20130086086 | INFORMATION GENERATING COMPUTER PRODUCT, APPARATUS, AND METHOD; AND INFORMATION SEARCH COMPUTER PRODUCT, APPARATUS, AND METHOD - A computer-readable recording medium stores a program causing a computer to execute an information generating process that includes tabulating an appearance frequency for each designated word in an object file group in which character strings are described; identifying for each designated word and based on the appearance frequency tabulated for the designated word, a rank in descending order up to a target appearance rate for the designated words; detecting in an object file selected from the object file group, specific designated words among the identified ranks; and generating for each of the detected specific designated words, index information that indicates the presence/absence of the specific designated word in each object file among the object file group. | 2013-04-04 |
| 20130086087 | APPARATUS AND METHOD FOR GENERATING AND RETRIEVING LOCATION-TAGGED CONTENT IN COMPUTING DEVICE - An apparatus and a method for generating and retrieving content in a computing device by operating a computing device, determining a location of the computing device and a place mark corresponding to the location is tagged to content. | 2013-04-04 |
| 20130086088 | Query Transformation for Masking Data Within Database Objects - According to one embodiment of the present invention, a system processes a database query, and comprises a computer system including at least one processor. The system identifies one or more expressions within the database query utilizing a database object with value masking. Masking requirements are determined for each identified expression and the database object utilized by that identified expression is replicated to provide masked and actual versions of that database object in response to the masking requirements for that expression including masked values and actual values of that database object. The value masking of the database object is applied to the identified expressions within the database query based on the determined masking requirements to produce search results with masked values for the database query. Embodiments of the present invention further include a method and computer program product for processing a database query in substantially the same manner described above. | 2013-04-04 |
| 20130086089 | TECHNIQUES FOR DISTRIBUTING INFORMATION OVER A NETWORK - Techniques for distributing information over a network having a database in data communication with said network include a method that records in the database a plurality of computer readable profiles. Each computer readable profile corresponds to one of multiple users of the network. One of the computer readable files includes a query term that is associated with it. Generated on a common user interface are both perceivable stimuli in response to activity on said network of users corresponding to subgroup of the plurality of computer readable profiles, and information corresponding to computer readable profiles of the subgroup. The corresponding users of the subgroup possess knowledge related to the query term. A region of the user interface in which the perceivable stimuli is present defines an activity stream region. A region of the user interface in which said information is present defines a connections region of the user interface. | 2013-04-04 |
| 20130086090 | BIOMETRIC MATCHING ENGINE - The present disclosure concerns a method of identifying a biometric record of an individual in a database ( | 2013-04-04 |
| 20130086091 | METHODS AND APPARATUS FOR ORGANIZING DATA IN A DATABASE - Disclosed are methods and apparatus for organizing data in a database in a set-oriented manner. Data is organized by linking data in the form of key-value pairs stored in storage media of the database to corresponding key-value pair identifiers. A set having a corresponding set identifier is then associated with one or more of the key-value pair identifiers where the set includes the stored key-value pairs linked to the key-value pair identifiers. | 2013-04-04 |
| 20130086092 | SYSTEMS AND METHODS RELATED TO A TEMPORAL LOG STRUCTURE DATABASE - In one general aspect, a computer-implemented method includes a computer-implemented method that includes executing, using at least one processor, instructions recorded on a non-transitory computer-readable storage medium. The method includes receiving a request to insert a data record within a database of a data collection system. The data record can be placed within a buffer in a main memory of the data collection system. A record data structure and a record index structure associated with the data record are defined. The record data structure and the record index structure are stored within a storage chunk in a storage medium of the database, and the storage medium is different than the main memory. The storage chunk has an associated index that can be used to retrieve the data record and the storage chunk can include other data records different than the data record associated with the received request. | 2013-04-04 |
| 20130086093 | SYSTEM AND METHOD FOR COMPETITIVE PRIOR ART ANALYTICS AND MAPPING - A computer-implemented method and system are provided for reviewing and mapping prior art. The method comprises using one or more processors to identify a first set of cited references cited against a target entity and identify at least a second set of cited references cited against at least one other entity. The first set of references are mapped against the at least second set of references to determine a prior art overlap of references common to both or all sets. A representation of the prior art overlap is communicated to a user. The method may include identifying the owners of the first and at least second sets of cited references. | 2013-04-04 |
| 20130086094 | SYSTEM AND METHOD FOR PATENT AND PRIOR ART ANALYSIS - Various embodiments of the present disclosure include systems and methods for analyzing patents and prior art in a patent management system. In an example embodiment, a computer-implemented method of determining a potential point of novelty for an identified patent comprises retrieving at least one independent claim of the patent in the claim form as issued; retrieving at least one independent claim of the patent in the claim form as published; and automatically comparing the issued claim to the published claim by identifying unique keywords present in the issued claim but not present in the published claim and flagging the unique keywords to a user. | 2013-04-04 |
| 20130086095 | MAKING AND USING ABSTRACT XML REPRESENTATIONS OF DATA DICTIONARY METADATA - An XML representation of the metadata for objects in a database system. The XML representation is called SXML. The SXML representations of two objects that belong to the same class of objects may be compared to produce a difference representation that shows the differences between the objects. Database commands that will create or alter objects may be produced from the difference representation, as well as an XML representation of the database commands. In addition to being comparable, SXML representations have the characteristics that a given property of the metadata is expressed in only one way in the representation, that SXML does not describe properties that belong only to particular instances of the object described by the metadata, that SXML describes only properties that the user can specify when creating an object, and that SXML is easy for humans to read, understand, and write. | 2013-04-04 |
| 20130086096 | Method and System for High Performance Pattern Indexing - Disclosed herein is a method and system for accelerating the generation of pattern indexes. In exemplary embodiments, regular expression pattern matching can be performed at high speeds on data to determine whether a pattern is present in the data. Pattern indexes can then be built based on the results of such regular expression pattern matching. Reconfigurable logic such a field programmable gate arrays (FPGAs) can be used to hardware accelerate these operations. | 2013-04-04 |
| 20130086097 | QUERY LANGUAGE BASED ON BUSINESS OBJECT MODEL - Methods and apparatus, including computer program products, are provided for providing a query language based on a model. In one aspect, there is provided a computer-implemented method. The method may include receiving a first query; generating, based on a model including metadata representing a data structure, a second query specific to the data structure stored in a database; and sending the second query to the database. Related apparatus, systems, methods, and articles are also described. | 2013-04-04 |
| 20130086098 | IDENTIFIER VOCABULARY DATA ACCESS METHOD AND SYSTEM - A method of organizing, managing, and providing interactive access to data in a database is disclosed, along with a program and a system for implementing the method. Associations between each data Item and at least one ItemSelector are established and stored. A predefined (but modifiable) Vocabulary of ItemSelectors sufficient to describe each Item of the database is created. Presently selected Items are described by a combination of associations defined by an appropriate Boolean combination of each ItemSelector in a presently selected set of ItemSelectors. A user controls the presently selected set by adding an ItemSelector from a presented group, or by removing a previously selected ItemSelector. The system ideally makes available to the user all relevant ItemSelectors—those which, if added to the presently selected set, would result in a set that describes at least one extant data Item. The system ideally makes all presently selected Items available to the user. | 2013-04-04 |
