13th week of 2012 patent applcation highlights part 59 |
Patent application number | Title | Published |
20120078834 | Sparse Representations for Text Classification - A sparse representation method of text classification is described. An input text document is represented as a document feature vector y. A category dictionary H provides possible examples [h | 2012-03-29 |
20120078835 | DATA BASED TRUTH MAINTENANCE METHOD AND SYSTEM - A truth maintenance method and system. The method includes receiving by a computer processor, health event data associated with heath care records for patients. The computer processor associates portions of the health event data with associated patients and related records in a truth maintenance system database. The computer processor derives first health related assumption data and retrieves previous health related assumption data derived from and associated with previous portions of previous health event data. The computer processor executes non monotonic logic with respect to the first health related assumption data and the previous health related assumption data. In response, the computer processor generates and stores updated first updated health related assumption data associated with the first health related assumption data and the previous health related assumption data. | 2012-03-29 |
20120078836 | System and Method for Predicting Tornado Activity - A system that predicts current tornado activity has been developed. The system includes a processor that receives model data from a meteorological data source that indicates tornadic activity and generates a model data tornado potential index. The processor also receives radar data indicative of tornadic activity and generates a radar data tornado potential index using weighted values assigned to different components of the radar data, where the components of said radar data comprise, a tornado vortex signature (TVS) data value, a mesocyclonic activity (MESO) data value, a precipitation and intensity (dBz) data value, a vertically integrated liquid (VIL) data value, and hail size data value. The processor further generates a composite tornado potential index using weighted values of the model data tornado potential index and the radar data tornado potential index and stores the index in an electronic data storage media. | 2012-03-29 |
20120078837 | DECISION-SUPPORT APPLICATION AND SYSTEM FOR PROBLEM SOLVING USING A QUESTION-ANSWERING SYSTEM - A decision-support system for problem solving comprises software modules embodied on a computer readable medium, and the software modules comprise an input/output module and a question-answering module. The method receives problem case information using the input/output module, generates a query based on the problem case information, and generates a plurality of answers for the query using the question-answering module. The method also calculates numerical values for multiple evidence dimensions from evidence sources for each of the answers using the question-answering module and calculates a corresponding confidence value for each of the answers based on the numerical value of each evidence dimension using the question-answering module. Further, the method outputs the answers, the corresponding confidence values, and the numerical values of each evidence dimension for one or more selected answers using the input/output module. | 2012-03-29 |
20120078838 | SYSTEM AND METHOD TO MEASURE CONTINUED ENGAGEMENT WITH SOFTWARE APPLICATION - A computing device includes a database, software code, and a processor. The software code, when executed by the processor, causes the computing device to predict users continued engagement with an external software application. The predictive software application transmits a data request to a database of an external software application, the requested data corresponding to a plurality of engagement variables for a set of users of the external software application. The predictive software application receives extracted data for the plurality of application engagement variables and stores the extracted data in a prediction database. The predictive software application calculates a weighting factor, identifying impact on future use, for each of the plurality of application engagement variables based on the analyzing of the extracted data for the plurality of application engagement variables. The predictive software application transmits the plurality of application engagement variables and the corresponding weighting factor to the existing application. | 2012-03-29 |
20120078839 | METHOD AND APPARATUS FOR PROVIDING LOW COST PROGRAMMABLE PATTERN RECOGNITION - An apparatus for providing pattern recognition may include at least one processor and at least one memory including computer program code. The at least one memory and the computer program code may be configured to, with the at least one processor, cause the apparatus to at least receive an indication of sensor data descriptive of movement of a user terminal, provide for expansion of the sensor data in a predetermined manner to define outcome values, apply a logical mask to the outcome values to generate selected outcome values for provision to a finite state machine, and utilize a pattern recognition algorithm associated with the finite state machine to determine whether the sensor data corresponds to a pattern identified by proceeding through defined transitions to a final state of the finite state machine. A corresponding computer program product and method are also provided. | 2012-03-29 |
20120078840 | APPARATUS, SYSTEM AND METHODS FOR COMPARING DRUG SAFETY USING HOLISTIC ANALYSIS AND VISUALIZATION OF PHARMACOLOGICAL DATA - Certain examples provide systems and methods for holistic viewing to provide comparative analysis and decision support in a drug development process, and safety testing. An example method includes providing a first set of data corresponding to a drug of interest; providing a reference set of drug interaction data, comparing the first set of data to the reference set using a holistic analysis, and reporting the results of the comparison. An example of the holistic analysis and viewing apparatus for drug safety comprises a standardizer to at least one of standardize and normalize drug interaction data related to drug safety; a deviation analyzer to compare the drug interaction data to data corresponding to a drug under review using a holistic analysis, and a reporter for reporting the output of the deviation analyzer. | 2012-03-29 |
20120078841 | INFORMATION GENERATING DEVICE, INFORMATION GENERATING METHOD, AND COMPUTER READABLE RECORDING MEDIUM - An information generating device in an information communication system in which contents and catalog information including its attribute information are distributed in node devices, includes: a first storage unit storing first catalog information, the catalog information including link information associating the plurality of attribute information with each other; a acquisition unit acquiring, in response to updating the content of the attribute information, the updated attribute information; a generation unit generating the link information for updating the first catalog information on the basis of the attribute information acquired by the first acquisition unit, and the first catalog information stored in the first storage unit, and generate second catalog information including the generated link information and the updated attribute information; a second storing unit storing the second catalog information; and an updating unit updating the first catalog information on the basis of the second catalog information for each given period. | 2012-03-29 |
20120078842 | MECHANISMS TO SUPPORT OBJECT-ORIENTED VERSION CONTROL OPERATIONS - Mechanisms to support object-oriented version control operations are provided. A user manipulates and views a project from an object viewpoint and within an object module. The user performs version control operations using object handles. The object handles are resolved to specific file references and the specific file references are used to process legacy version control commands utilizing a legacy version control system in a manner that is transparent to the user. | 2012-03-29 |
20120078843 | ENHANCING DATA STORE BACKUP TIMES - Provided are techniques for selecting a first group of indexes to form a current generation of indexes, selecting indexes from the first group biased to indexes with higher fitness values from the current generation of indexes, forming sub-groups of indexes using the selected indexes, determining fitness values of each of the sub-groups based on the fitness value of each of the indexes, selecting a subset of the sub-groups; and placing the indexes in the selected sub-groups into a new generation of indexes. | 2012-03-29 |
20120078844 | SYSTEM AND METHOD FOR DISTRIBUTED PROCESSING OF FILE VOLUME - A file processing system includes a system targeting unit to target a distributed file system, a chunk generator to generate a chunk including file blocks and to generate copies of the chunk to be stored in the distributed file system, a data storage medium to store the chunk, and a chunk operation requesting unit to request storage of the generated chunk copies in the distributed file system. A distributed file system includes a first data server and a second data server. Each data server includes a chunk storage unit to store a chunk copy received from a file processing system, and a chunk operation performing unit to generate an identical copy of the stored chunk copy that is undamaged to replace a damaged chunk copy. | 2012-03-29 |
20120078845 | METHOD AND SYSTEM FOR DIRECTORY MANAGEMENT - System and method for extracting, retrieving and managing data in a computer or network of computers through an enhancement of the power of the directory management system and email management system by enabling users to superimpose a hierarchy of descriptors on top of the system, to share, import and export the hierarchy of descriptors between computers with controlled access for data objects. The method and system is defined particularly for selecting individual references from search engine results and saving them along with descriptors. The method and system automatically generate reports of work done in the computer or network of computers, including creation, modification, copying, moving and deletion of files and folders. The method and system reduces the clutter of information while ensuring that the system is automatically backed up in different modes and with complete flexibility to back up. | 2012-03-29 |
20120078846 | SYSTEMS AND METHODS OF MANAGING VIRTUAL STORAGE RESOURCES - Systems and methods of managing virtual storage resources are disclosed. An exemplary method includes analyzing parameters of a plurality of backup jobs over time to model backup lifecycle. The method also includes estimating size of available storage capacity over time based on the modeled backup lifecycle. The method also includes identifying storage options using the available storage capacity on an ongoing basis for future backup jobs. | 2012-03-29 |
20120078847 | System and method for managing integrity in a distributed database - Cluster recovery time is reduced by an incremental refresh technique that is described herein. The goal of the technique is to salvage the portion of the redundant distributed database lost (e.g., during a fault) by performing an incremental refresh of only the updates occurring to that portion of the database since the time of loss. | 2012-03-29 |
20120078848 | METHODS FOR DYNAMIC CONSISTENCY GROUP FORMATION AND SYSTEMS USING THE SAME - A method for dynamic consistency group formation, in one embodiment, includes creating a snapshot of first data stored on a source storage system with respect to data content and data structure, copying the snapshot to a target storage system, detecting one or more write operations affecting data on the source storage system while copying the first data, detecting one or more collisions affecting the first data on the source storage system, wherein a collision occurs whenever the write operations affect the first data prior to the first data being written, setting a consistency group interval which represents an interval duration between successive snapshot create-and-copy events, and altering the consistency group interval to minimize collisions affecting data on at least one of the storage systems. Other methods, systems, and computer program products for dynamic consistency group formation are also described. | 2012-03-29 |
20120078849 | System and method for enhancing availability of a distributed object storage system during a partial database outage - An “operate with missing region” feature of this disclosure allows the cluster to continue servicing reads for available regions even when some regions are missing. In particular, upon a given node failure condition, the cluster is placed in an effective read-only mode for all regions. The node failure condition typically is one where there has been a failure of an authoritative region copy and no backup copy is then available. As used herein, “read-only” means that no client write or update requests will succeed while the cluster is in this state. In particular, those requests should fail with an error message (or the like) that indicates failure because of the read-only status. Preferably, such requests are then re-tried. In this mode, all regions are only allowed to perform read operations. During the read-only state, the cluster continues to operate with missing regions, and missing regions are entered on the region map. The cluster then automatically recovers returning missing region(s), after which is leaves the read-only state. | 2012-03-29 |
20120078850 | System and method for managing scalability in a distributed database - This disclosure enables a user to incrementally increase or decrease the size of the cluster and, in particular, to incrementally increase or decrease the number of map regions implemented in a metadata manager associated with the cluster while maintaining availability of the cluster. In a representative embodiment, a configurable target map size is identified, either manually (e.g., by the user) or programmatically. If the target map size is found to be within an acceptable value (given the available node configuration), a procedure to create a new map is triggered. The new map preferably is generated as follows. Initially, one or more new temporary region(s) are created either to split or join the existing regions (depending on whether the map is being increased or decreased). For each temporary region, the process also generates MDPL backup regions. Metadata from an original region (or regions) is then migrated to the temporary region(s). Once the migrations have been completed, the old region or regions (from which the metadata is migrated) are removed and what were the temporary regions are, in effect, promoted. The result is the new map. | 2012-03-29 |
20120078851 | DATA BACKUP SYSTEM - In order to back up a user's set of data (Ens) through a telecommunications network (RT), a terminal (TC) retrieves, from an application server (SA), a table (Tab) containing sets of risk factors (Fr | 2012-03-29 |
20120078852 | Prioritization of Data Items for Backup in a Computing Environment - Described are embodiments of an invention for prioritizing data items for backup in a computing environment. The computing environment includes a plurality of clients coupled through a network to a backup system for backing up items stored locally on the client. Each client includes a continuous data protection (CDP) module that prioritizes the order of files transmitted to the backup system for storage on one or more storage devices based on policy. The CDP module builds an initial backup list and a CDP backup list. The initial backup list includes any item that meets the criteria of the initial backup profile. The CDP backup list includes items that have been modified since the initial backup process began. The data that is the most critical to a user is often the most recently modified data. Thus, the CDP module preferentially performs a backup of items on the CDP backup list. | 2012-03-29 |
20120078853 | SYSTEMS, METHODS, AND APPARATUS FOR FACILITATING CHEMICAL ANALYSES - A knowledge management platform eliminates the trial and error process for analytical chemists in, for example, identifying appropriate methodologies for separating mixtures of chemical compounds. The platform allows the analytical chemists to perform a variety of searches on data existing from previous experiments, procedures, and/or processes. The platform may be employed to make faster decisions, and ultimately decreases the time taken in selecting an appropriate separation methodology. | 2012-03-29 |
20120078854 | SYSTEM AND METHOD FOR SCALEABLE MULTIPLEXED TRANSACTIONAL LOG RECOVERY - A system and method for providing scaleable recovery for a multiplexed transactional log. Unlike a dedicated log that includes log data of only one client, a multiplexed transactional log may include log data from multiple clients. In a multiplexed transactional log, log data from different clients may be multiplexed into the multiplexed transactional log in any order. The multiplexed log is maintained for multiple clients using a scaleable logging process. After a system failure, the multiplexed log is recovered using a scaleable recovery process. The scaleable recovery process includes an end-of-log locating process for locating the end of the multiplexed log and each of the virtual logs with the multiplexed log. The end-of-log locating process is also scaleable. | 2012-03-29 |
20120078855 | METHOD AND SYSTEM OF PERFORMING A GRANULAR RESTORE OF A DATABASE FROM A DIFFERENTIAL BACKUP - A system and method for performing a granular restore operation of a database from a differential backup of the database. A bitmask is created during a differential backup and stored with the differential backup file. When a user requests a granular restore operation, views of how the database existed at different points of time may be presented to the user. The objects the user wishes to restore may be selected from one of the views. Next, the bitmask may be read to determine if the objects should be retrieved from the differential backup file or a full backup file. Finally, the objects may be restored to the database from the proper file. | 2012-03-29 |
20120078856 | METHODS AND APPARATUS FOR POINT-IN-TIME VOLUMES - Methods and apparatus for point-in-time volumes are provided. A relationship is enabled between a source volume and point-in-time volume. Copying a data chunk to the point-in-time volume before a write operation modifies the data chunk on the source volume dynamically creates the point-in-time volume. The point-in-time volume can be accessed in read/write mode as a general purpose data storage volume. Other embodiments comprising additional features, such as a forced migration process, are also provided. | 2012-03-29 |
20120078857 | COMPARING AND SELECTING DATA CLEANSING SERVICE PROVIDERS - The present invention extends to methods, systems, and computer program products for exploring and selecting data cleansing service providers. Embodiments of the invention permit a user to explore different data cleansing service providers and compare quality results from the different data cleansing service providers. Sample data is mapped to a specified data domain. A list of service providers, for cleansing data for the selected data domain, is provided to a user. The user selects a subset of service providers. The sample data is submitted to the subset of service providers, which return results including allegedly cleansed data. The results are profiled and a comparison of the subset of service providers is presented to the user. The user selects a service provider to use when cleansing further data. | 2012-03-29 |
20120078858 | De-Duplicating Data in a Network with Power Management - A method, computer system, and computer program product for managing copies of data objects in a network data processing system. The computer system identifies copies of a data object stored on storage devices. The computer system places the storage devices into groups. Each storage device in a group has a smallest distance from the storage device to a center location for the group as compared to distances to center locations for other groups within the groups. The computer system selects a portion of the copies of the data object for removal from the storage devices based on a management of power for the storage devices such that remaining set of storage devices in each group is capable of handling concurrent requests that have been made historically for the copies of the data object. The computer system removes the portion of the copies of the data object from the storage devices. | 2012-03-29 |
20120078859 | SYSTEMS AND METHODS TO UPDATE A CONTENT STORE ASSOCIATED WITH A SEARCH INDEX - Some aspects include determination of second document identifiers added to a search index. The search index associates each of a plurality of words with at least one of a plurality of first document identifiers. For each of the second document identifiers, metadata of a document identified by the second document identifier is added to a content store storing metadata of each document identified by the plurality of first document identifiers. | 2012-03-29 |
20120078860 | ALGORITHMIC COMPRESSION VIA USER-DEFINED FUNCTIONS - A method, apparatus, and article of manufacture for accessing data in a computer system. One or more user-defined functions (UDFs) implementing a desired compression or decompression algorithm are created, wherein the UDFs are associated with one or more columns of a table when the table is created or altered, in order to perform compression or decompression of data stored in the associated columns, such that the data is compressed by the UDF implementing the desired compression algorithm when the data is inserted or updated in the table, and the data is decompressed by the UDF implementing the desired decompression algorithm when the data is retrieved from the table. | 2012-03-29 |
20120078861 | METHOD FOR PROCESSING A DIGITAL FILE NOTABLY OF THE IMAGE, VIDEO AND/OR AUDIO TYPE - A method for processing a digital file of the images, video and/or audio type which comprises a phase for putting into line per color layer and/or per audio channel, digital data of any audio, image and video file, a compression phase using algorithm in which each compressed value VC | 2012-03-29 |
20120078862 | HYBRID OFF-PEAK AND JUST-IN-TIME INTEGRATION - The invention is directed to off-peak and just-in-time (JIT) retrieval of directory information to reduce network traffic and load on directory servers and/or data sources by requesting only the information that is currently needed from the directory server, while subsequently updating the directory information during an off-peak period in the case that the directory information retrieved in a JIT manner is outdated. In these embodiments, a hybrid integrator operable with an integration directory capable of retrieving directory information in a JIT manner provides this functionality. Specifically, the hybrid integrator and the integration directory are configured to receive a request for directory information at the hybrid integrator, and record the request. The integration directory retrieves a set of current attribute values in a JIT manner from at least one of the following: the directory server, and an external source. During an off-peak period, it is determined whether each of the set of current attribute values corresponding to the request is current. Based on whether each of the set of current attribute values corresponding to the request is current, a set of updated current attributes is retrieved from at least one of the following: a directory server, and an external source. | 2012-03-29 |
20120078863 | APPLICATION CONTROL CONSTRAINT ENFORCEMENT - Systems and methods for performing application control constraint enforcement are provided. According to one embodiment, file system or operating system activity of a computer system is intercepted relating to a code module. A cryptographic hash value of the code module is checked against a local whitelist database containing cryptographic hash values of approved code modules, which are known not to contain viruses or malicious code. The local whitelist database also contains execution constraint information. When the cryptographic hash value matches one of the cryptographic hash values of approved code modules, authority of the computer system or an end user of the computer system to execute the code module is further validated if the execution constraint information so indicates by performing a constraint check regarding the code module. If the authority is affirmed by the constraint check, then allowing the code module to be executed. | 2012-03-29 |
20120078864 | ELECTRONIC DATA INTEGRITY PROTECTION DEVICE AND METHOD AND DATA MONITORING SYSTEM - The present invention discloses an electronic data integrity protection device and method and a data monitoring system, wherein the device includes: a data reception unit configured to receive electronic data; a signal reception unit configured to receive an external signal; a signal processing unit configured to process the external signal in accordance with a predetermined integrity protection strategy, to output a corresponding instruction, wherein the integrity protection strategy specifies at least an integrity protection mode associated with the external signal; and an integrity protection operation unit configured to perform, in response to the instruction, integrity protection operation on the electronic data so as to generate integrity protection information. According to the technical solution of the invention, it is possible to provide appropriate integrity protection for data when an external signal occurs, realize event-driven integrity and achieve a good balance among security, resource consumption and efficiency. | 2012-03-29 |
20120078865 | DYNAMIC CONFIGURATION OF A PERSISTENCE PROVIDER - Provided are techniques for updating a physical data structure type. A persistence provider is updated with dynamic configuration data for the updated physical data structure type while an application is executing. The application that is executing is allowed to access the updated physical data structure type using the updated persistence provider to map an application level object type to the updated physical data structure type without restarting the application. | 2012-03-29 |
20120078866 | Method For Managing Lock Resources in a Distributed Storage System - A method and a distributed locking system for the management of lock resources in a distributed files system having several lock managers, each managing lock resources in its respective domain. Each lock manager maintains a registry lock file that comprises of a list of all locked files and a list of lock requests. The registry lock files of all lock managers in the distributed locking system are saved in a central database. Furthermore, the system enables concurrent locking operations of different file sharing protocols on the same file system resources. | 2012-03-29 |
20120078867 | Multi-Dimensional Road Representation - A method and system for representing multiple road properties with a single multi-dimensional parametric spline curve is disclosed. A B-Spline is generated to represent a first road dimension. The B-Spline is written mathematically in vector format. One or more road dimensions to be added to the B-Spline are selected. Depending on the selection, the road dimensions are created in a format compatible with the B-Spline. For example, the road dimensions may be created using curve fitting, B-Spline merger, or direct assignment. Once the road dimensions are created, they are added to the original B-Spline vector. The new B-Spline vector is then stored in a data storage unit for use by systems, such as Advanced Driver Assistance Systems. | 2012-03-29 |
20120078868 | Stream Processing by a Query Engine - A database system executes a method that receives, at a query engine in the database system, a continuous stream of data. The query engine continuously analyzes the continuous stream of data with window functions in a single long-standing query. | 2012-03-29 |
20120078869 | METHODS AND APPARATUS TO MANAGE PROCESS CONTROL SEARCH RESULTS - Example methods and apparatus to manage process control search results are disclosed. A disclosed example method includes receiving a search parameter from a user via an application to view search results associated with the search parameter, determining a display context based on the application, searching a search index for control parameters that match the search parameter to form a set of matched control parameters, wherein the search index includes control parameters that correspond to runtime data generated by a controller within a process control system, and rendering the set of matched control parameters for display via the application as the search results based on the determined display context. | 2012-03-29 |
20120078870 | APPARATUS AND METHOD FOR COLLABORATIVE SOCIAL SEARCH - A system is provided for allowing collaboration among users while they conduct information searches. The system allows users to share their search queries and see what other users are searching for. This is accomplished by copying the search queries of users to a message board type activity stream where a user can see other users' search queries. In the process it allows users to help other users by providing guidance and additional information on their queries or in other ways by responding to other users' search queries. Additionally, a system is provided to allow users to discover other users who are searching for the same information concurrently, and a system that shows other users that the current user has included in his or her sharing network who have previously searched for the same information. | 2012-03-29 |
20120078871 | DETECTING DUPLICATE AND NEAR-DUPLICATE FILES - Improved duplicate and near-duplicate detection techniques may assign a number of fingerprints to a given document by (i) extracting parts from the document, (ii) assigning the extracted parts to one or more of a predetermined number of lists, and (iii) generating a fingerprint from each of the populated lists. Two documents may be considered to be near-duplicates if any one of their fingerprints match. | 2012-03-29 |
20120078872 | METHOD, SEARCH SERVER, AND SYSTEM FOR MOBILE SEARCH INTERFACE ADAPTATION - A method, a search server, and a system for mobile search interface adaptation are provided. The method for query interface adaptation for mobile search includes: receiving a search request represented by a global query interface schema; according to a mapping relationship between an attribute in the global query interface schema and an attribute in a local query interface schema of each member engine, converting the search request represented by the global query interface schema into a search request represented by the local query interface schema of each member engine; and distributing the search request represented by the local query interface schema of each member engine to each member search engine. Therefore, efficiency and accuracy of mobile search are greatly improved. | 2012-03-29 |
20120078873 | USING ONTOLOGICAL INFORMATION IN OPEN DOMAIN TYPE COERCION - A computer-implemented system, method and program product generates answers to questions in an input query text string. The method includes determining, by a programmed processor unit, a lexical answer type (LAT) string associated with an input query; automatically obtaining a candidate answer string to the input query from a data corpus; mapping the query LAT string to a first type string in a structured resource; mapping the candidate answer string to a second type string in the structured resource; and determining if the first type string and the second type string are disjointed; and scoring the candidate answer string based on the determination of the types being disjointed wherein the structured resource includes a semantic database providing ontological content. | 2012-03-29 |
20120078874 | Search Engine Indexing - Exemplary embodiments include a search engine indexing method, including finding a page on a server that includes keywords, scanning the page for a tag designating a portion of the page from which to index the keywords and in response to a presence of the tag within the page, indexing the portion of the page that is designated by the tag. | 2012-03-29 |
20120078875 | WEB BROWSER CONTACTS PLUG-IN - A system for collecting information from visited websites in a web browser. The system includes a web browser plug-in application having a set of user preferences for collecting certain target information from website. The system monitors the user navigating to one or more selected web-sites and parsing the websites for relevant target information. The system then compares the target information with the verified information stored in the database to generate relevant verified information. The user is alerted to the relevant verified website information and any target information that was not matched to the database. The user is then given the option of storing the relevant verified website information or searching for additional information. The unmatched information could potentially be crowd sourced to find the verified information or saved as verified information on its own. The user can then import the collected information into a workstation application. | 2012-03-29 |
20120078876 | Method of Recommending Items to a User Based on User Interest - Although recording of usage data is common in scholarly information services, its exploitation for the creation of value-added services remains limited due to concerns regarding, among others, user privacy, data validity, and the lack of accepted standards for the representation, sharing and aggregation of usage data. A technical, standards-based architecture for sharing usage information is presented. In this architecture, OpenURL-compliant linking servers aggregate usage information of a specific user community as it navigates the distributed information environment that it has access to. This usage information is made OAI-PMH harvestable so that usage information exposed by many linking servers can be aggregated to facilitate the creation of value-added services with a reach beyond that of a single community or a single information service. | 2012-03-29 |
20120078877 | MULTI-SOURCE SEARCHING IN A DATA DRIVEN APPLICATION - Embodiments of the invention provide a method, system and computer program product for a multi-source search. In an embodiment, a method for multi-source searching for a data driven application includes defining a form for a data driven application that includes user interface controls each corresponding to respectively to different fields in different data sources. The method also includes generating a search index for the form incorporating the different fields, coupling the form with a search user interface that includes a search control configured to accept at least one query term and associating the search control with a selection of the different fields. Thereafter, during execution of the data driven application, a search engine query can be directed for the selection of the different fields in the search index and not the different data sources according to the at least one query term provided in the search user interface. | 2012-03-29 |
20120078878 | OPTIMIZED LAZY QUERY OPERATORS - Query operators such as those that perform grouping functionality can be implemented to execute lazily rather than eagerly. For instance, one or more groups can be created and/or populated lazily with one or more elements from a source sequence in response to a request for a group or element of a group. Furthermore, lazy execution can be optimized as a function of context surrounding a query, among other things. | 2012-03-29 |
20120078879 | Multi-Dataset Global Index - A system and method is provided for partitioning a global index into multiple index datasets to house indexes and their index values. The index datasets may be stored in initialized physical index areas that are distinct from a standard physical index area. | 2012-03-29 |
20120078880 | Accelerating Database Queries Containing Bitmap-Based Conditions - Systems, methods and articles of manufacture for accelerating database queries containing bitmap-based conditions are described herein. An embodiment includes determining a bitmap, where the bitmap represents a set of rows that have satisfied one or more conjunctive conditions which preceded a conjunct that is a disjunction in a query expression and restricting evaluation of a disjunct within the disjunction to the set of rows represented by the bitmap. Another embodiment includes determining a satisfaction bitmap, where the bitmap represents the result of one or more preceding disjuncts in a disjunction within a query expression and restricting scope of evaluation of a disjunct to a set of rows that are not within the determined satisfaction bitmap. In this way, embodiments of the present invention enable the acceleration of queries containing disjunctions of conditions on a database table, as well as reduce the temporary resources consumed for such queries. | 2012-03-29 |
20120078881 | SYSTEM AND METHOD FOR AGGREGATING QUERY RESULTS IN A FAULT-TOLERANT DATABASE MANAGEMENT SYSTEM - A redundant array of independent nodes are networked together. Each node executes an instance of an application that provides object-based storage. Metadata objects are stored in a set of regions distributed among the nodes across the array. A given region is identified by hashing a metadata object attribute and extracting a given set of bits of a resulting hash value. A method of managing query results comprises: receiving, by a first node of the plurality of independent nodes from a client application, a request for a list of objects with a criterion; issuing by the first node a query to all the nodes based on the received request; processing the query by each node over the regions in the node using the metadata objects stored in the regions; aggregating and filtering by the first node results of the query from all the nodes; and returning by the first node the aggregated and filtered results to the client application. | 2012-03-29 |
20120078882 | METHOD AND APPARATUS FOR DETERMINING SEARCH RESULTS BASED ON FILTERED INFORMATION - An approach is provided for determining results based on filtered information. A context request is detected from one or more programs. Another program determines to filter the content request, the one or more programs, or a combination thereof. One or more results of the content request are determined based, at least in part, on the filtered content request, the filtered one or more programs, or a combination thereof | 2012-03-29 |
20120078883 | ACCESSING DOCUMENTS USING PREDICTIVE WORD SEQUENCES - Methods and systems for accessing documents in document collections using predictive word sequences are disclosed. A method for accessing documents using predictive word sequences include creating a candidate list of word sequences where respective ones of the word sequences comprise one or more elements derived from the document corpus; expanding the candidate list by adding one or more new word sequences, where each new pattern is created by combining one or more elements derived from the document corpus with one of the word sequences currently in the candidate list; determining a predictive power with respect to the subject for respective ones of entries of the candidate list, where the entries include the word sequences and the new word sequences; pruning from the candidate list ones of said entries with the determined predictive power less than a predetermined threshold; and accessing documents from the document corpus based on the pruned candidate list. The expanding of the candidate list can include creating each new pattern as a gapped sequence, where the gapped sequence comprises one of the word sequences and one of said elements separated by zero or more words. Corresponding system and computer readable media embodiments are also disclosed. | 2012-03-29 |
20120078884 | PRESENTING SOCIAL SEARCH RESULTS - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for detecting malicious system calls. In one aspect, a method includes identifying members of a social affinity group of the user, the social affinity group having members having a relationship to the user. The method includes receiving search results including search results that reference resources associated with members of the social affinity group. The method includes identifying a first search result that references the social network site. The method includes identifying a second search result that references a resource found on the social network site and associated with a member of the social affinity group. The method includes generating a response to the query comprising instructions that the first search result be presented in proximity to the second search result. | 2012-03-29 |
20120078885 | BROWSING HIERARCHIES WITH EDITORIAL RECOMMENDATIONS - Browsing content stored in a content source. A hierarchical tree structure is accessed. The hierarchical tree structure has nodes that correspond to at least one query for recommended content that is recommended based on editorial recommendations. Recommended content stored in the content source is browsed by executing the at least one query for recommended content, the at least one query corresponding to at least one node of the hierarchical tree structure. The browsing is performed in accordance with a hierarchy of the hierarchical tree structure. | 2012-03-29 |
20120078886 | BIOMETRIC INDEXING AND SEARCHING SYSTEM - A prototype biometric identification system is disclosed that indexes a biometric corpus into indexed-corpuses using a set of P prototypes before searching for a probe in a search corpus constructed based on the indexed-corpus. The system may index the biometric corpus based on the prototypes directly or based on prototype-typicality scores. | 2012-03-29 |
20120078887 | METHOD AND SYSTEM FOR LIMITING SHARE OF VOICE OF INDIVIDUAL USERS - In various example embodiments, a system and method for limiting shares of voice of individual users in a result set are provided. In example embodiments, a listing user providing each listing in a result set of a search is identified. Sorting criteria indicating a number of listings a same listing user is allowed within a number of consecutive listings of the result set are reviewed. Using the sorting criteria, a sorted result set is generated by sorting the plurality of listings in accordance with the sorting criteria. The sorted result set is provided to a searching user. | 2012-03-29 |
20120078888 | PROVIDING ANSWERS TO QUESTIONS USING LOGICAL SYNTHESIS OF CANDIDATE ANSWERS - A method, system and computer program product for generating answers to questions. In one embodiment, the method comprises receiving an input query, decomposing the input query into a plurality of different subqueries, and conducting a search in one or more data sources to identify at least one candidate answer to each of the subqueries. A ranking function is applied to each of the candidate answers to determine a ranking for each of these candidate answers; and for each of the subqueries, one of the candidate answers to the subquery is selected based on this ranking. A logical synthesis component is applied to synthesize a candidate answer for the input query from the selected the candidate answers to the subqueries. In one embodiment, the procedure applied by the logical synthesis component to synthesize the candidate answer for the input query is determined from the input query. | 2012-03-29 |
20120078889 | PROVIDING ANSWERS TO QUESTIONS USING HYPOTHESIS PRUNING - A method, system and computer program product for generating answers to questions. In one embodiment, the method comprises receiving a query, conducting a search through one or more data sources to identify candidate answers to the query, and providing each of the candidate answers with a preliminary score. The method further comprises filtering out any of the candidate answers with a preliminary score that does not satisfy a defined condition. The candidate answers having preliminary scores that satisfy this condition form a subset of the candidate answers. Each of the candidate answers in this subset is processed to produce further scores. A ranking function is applied to these further scores to determine a ranking for each of the candidate answers in the subset; and after this ranking function is applied, one or more of the candidate answers are selected as one or more final answers to the query. | 2012-03-29 |
20120078890 | LEXICAL ANSWER TYPE CONFIDENCE ESTIMATION AND APPLICATION - A system, method and computer program product for automatically estimating the confidence of a detected LAT to provide a more accurate overall score for an obtained candidate answer. A confidence “score” or value of each detected LAT is obtained, and the system and method performs combining the confidence score with a degree of match between a LAT and an AnswerType of the candidate answer to provide improved overall score for the candidate answer. | 2012-03-29 |
20120078891 | PROVIDING ANSWERS TO QUESTIONS USING MULTIPLE MODELS TO SCORE CANDIDATE ANSWERS - A method, system and computer program product for generating answers to questions. In one embodiment, the method comprises receiving an input query; conducting a search to identify candidate answers to the input query, and producing a plurality of scores for each of the candidate answers. For each of the candidate answers, one, of a plurality of candidate ranking functions, is selected. This selected ranking function is applied to the each of the candidate answers to determine a ranking for the candidate answer based on the scores for that candidate answer. One or more of the candidate answers is selected, based on the rankings for the candidate answers, as one or more answers to the input query. In an embodiment, the ranking function selection is performed using information about the question. In an embodiment, the ranking function selection is performed using information about each answer. | 2012-03-29 |
20120078892 | Searching for Virtual World Objects - Systems and methods for searching for objects located in a virtual world include having a virtual construct such as a bot crawl the virtual world by moving from place to place. Object information is collected about the objects associated with the place and the object information is stored in a searchable database. Users can search the database for objects in the virtual world. The information can be further filtered or classified to aid in searching. | 2012-03-29 |
20120078893 | Determining Sort Order By Distance - Included are embodiments for determining sort order. At least one embodiment of a method includes determining a plurality of search results associated with at least one search criteria. Some embodiments of a method include determining a first distance between at least one of the search results and a home page associated with the at least one search result and determining a display order for the plurality of search results. | 2012-03-29 |
20120078894 | Trend Analysis in Content Identification Based on Fingerprinting - Fingerprint-based content identification is described. Bin-counting detects linear trends based on data points that are generated from a set of query fingerprints, which are extracted from a query content item and a matching set of corresponding reference content items that are extracted from a reference content item. RANSAC may detect trends based on confidence scores that are computed for multiple candidate content items. The trends detected for the candidate content items are compared against a threshold in order of decreasing confidence score until a trend that satisfies the threshold is found. A ranking-based mechanism for fingerprint-based content identification may use a bin-counting or RANSAC-based trend detection mechanism to identify duplicate or multiple reference content items that all match the same query content item. | 2012-03-29 |
20120078895 | SOURCE EXPANSION FOR INFORMATION RETRIEVAL AND INFORMATION EXTRACTION - System, method and computer program product for 1) preparing queries for retrieving related content based on existing data content. For instance, titles of existing documents or entities extracted from documents can be used as queries. 2) Retrieving content from other repositories of unstructured, semi-structured, or structured data. For instance, web pages can be retrieved using existing search engines. 3) Extracting smaller units of text from the retrieved content. For instance, web pages can be split into coherent paragraphs of text. 4) Judging the quality of the smaller units of text and their relatedness to existing data. For instance, paragraphs can be scored using a statistical model based on lexico-syntactic features and topic models. 5) Synthesizing new sources from high-quality related text. For instance, paragraphs that score above a threshold can be concatenated into a new document. | 2012-03-29 |
20120078896 | SYSTEMS, METHODS AND ARTICLES OF MANUFACTURE TO PROVIDE A SEARCH SERVICE TO A PROCESS CONTROL SYSTEM - Systems, methods, and articles of manufacture to provide a search service to users of a process control system are disclosed. An example system includes a search database to store a set of searchable items associated with a process control system and to store a search profile associated with a selected query result, a publisher to collect information associated with the searchable items from the process control system and to publish the collected information to the search database, and a searcher to receive a request including the search profile and a query of the searchable items in the database, to search the searchable items based on the query, and to return at least a portion of the collected information based on the search profile. | 2012-03-29 |
20120078897 | Content Searching and Configuration of Search Results - Content searching and configuration of search results are described. In an implementation, a method includes in response to a search query, selecting a keyword based on heuristic data which describes a plurality of previously performed searches. A search is performed utilizing the search query and the selected keyword to locate content. | 2012-03-29 |
20120078898 | Method and Device for Modifying Meta Data of Media Objects - The present invention provides a method for handling meta data of media objects, comprising creating a media object at a mobile electronic device, obtaining at least one rule defining modifications for positional data relating to at least one geographical area, determining positional data relating to the current geographical position of said mobile electronic device, applying said at least one rule to said positional data to derive positional meta data if said positional data relate to said at least one geographical area, deriving positional meta data from said determined positional data if said determined positional data do not relate to said at least one geographical area, and associating said positional meta data with said media object. An electronic device capable of performing the method is also provided. | 2012-03-29 |
20120078899 | SYSTEMS AND METHODS FOR DEFINING OBJECTS OF INTEREST IN MULTIMEDIA CONTENT - Methods and systems for detecting objects of interest in multimedia content are disclosed. One method includes receiving multimedia content at one or more computing systems, and generating a plurality of scenes from the multimedia content, each of the plurality of scenes including one or more candidate objects of interest. The method also includes receiving selection of one or more of the candidate objects of interest as objects of interest, and defining one or more actions to be taken with respect to one or more of the objects of interest. The method further includes generating metadata associated with each of the objects of interest, the metadata defining actions to be taken with respect to the one or more of the objects of interest. | 2012-03-29 |
20120078900 | Method of Delivering Goods and Services Via Media - A method for distributing a prescription pharmaceutical product includes recording a unique identifier in a database that identifies a medium and a prescription pharmaceutical product associated with the medium. The database is provisioned with criteria that establish different potential values for the medium. Thus, the medium has a variable value that varies according to the criteria provisioned in the database. A holder of the medium then presents the medium to a provider of the prescription pharmaceutical product. Upon receipt the medium, the provider communicates the unique identifier associated with the medium. Based on the unique identifier of the medium and the variable value criteria provisioned in the database, the value of the medium is determined and communicated to the provider. The holder then utilizes the determined value to purchase the prescription pharmaceutical product associated with the medium. | 2012-03-29 |
20120078901 | Personal Genome Indexer - The present invention relates to method and computer systems that provide a personal genome indexer. The present invention provides an output that allows individuals to access publically available scientific resources through the “prism” of their unique genetic code. Individual genetic information is indexed with information from public databases (e.g., PubMed database) that contain genetic information about the condition and the risk allele, and public databases (e.g., MedLinePlus database) that provide information about the condition. In an aspect, the present invention provides an output display that correlates an individual's specific risk alleles with genetic information and associated phenotypic condition based on one or more references from a publically accessible database, and/or a link to consumer health information about the phenotypic condition. | 2012-03-29 |
20120078902 | PROVIDING QUESTION AND ANSWERS WITH DEFERRED TYPE EVALUATION USING TEXT WITH LIMITED STRUCTURE - A system, method and computer program product for conducting questions and answers with deferred type evaluation based on any corpus of data. The method includes processing a query including waiting until a “Type” (i.e. a descriptor) is determined AND a candidate answer is provided. Then, a search is conducted to look (search) for evidence that the candidate answer has the required Lexical Answer Type (e.g., as determined by a matching function that can leverage a parser, a semantic interpreter and/or a simple pattern matcher). Prior to or during candidate answer evaluation, a process is provided for extracting and storing collections of entity-type pairs from semi-structured text documents. During QA processing and candidate answer scoring, a process is implemented to match the query LAT against the lexical type of each provided candidate answer and generate a score judging a degree of match. | 2012-03-29 |
20120078903 | IDENTIFYING CORRELATED OPERATION MANAGEMENT EVENTS - A technique includes receiving data indicative of operation management events, where each event occurs at an associated time. The technique includes processing the data to selectively group the events in episodes based on the associated times and identifying which events are correlated based at least in part on the episodes. | 2012-03-29 |
20120078904 | Approximate Index in Relational Databases - A database table is provided. The database table includes several column tuples. A column is selected in the database table. The column tuples of the selected column are partitioned into several bins. Each bin includes a range of tuples and associated metadata. The associated metadata includes at least one of: a minimum tuple value for the tuples in the bin, a maximum tuple value for the tuples in the bin, a minimum tuple identifier for the bin and a maximum tuple identifier for the bin. The bins are sorted based on the tuple values to provide an approximate index for the database. | 2012-03-29 |
20120078905 | MANIPULATING NON-SCHEMA ATTRIBUTES FOR OBJECTS IN A SCHEMA BASED DIRECTORY - Systems and methods for defining attributes for one or more entries in a computer implemented directory structure. The method comprises grouping a set of non-schema attributes associated with a directory entry into a multivalue schema attribute, wherein the multivalue attribute comprises values associated with each of the corresponding non-schema attributes grouped into the multivalue attribute; encoding at least one of the non-schema attributes into a string having one or more parts; and performing computing operations on the non-schema attributes in the directory entries based on content of the encoded strings defined in the multivalue attribute in which the respective non-schema attributes are grouped. | 2012-03-29 |
20120078906 | AUTOMATED GENERATION AND DISCOVERY OF USER PROFILES - A robust knowledge-based management and sharing system organized by context for expertise-based or context-based searching and retrieval of relevant information is disclosed. The various embodiments and techniques described herein are used to organize a user's data and communications around the user's expertise or one or more contexts the user is associated with such as the user's projects, products, and customers. The organization of user data is derived from the user's competencies and interactions with others and is used to build and index user profiles in a manner that facilitates retrieval in search results for relevant search criteria. A linguistic processing pipeline is used to parse and index the user's data to generate the complete and partial profiles organized by context. Complete and partial profiles are generated, indexed, ranked, and stored by the system. Once a profile is built and indexed into the proper expertise or context(s), it can yield highly relevant results in searches for persons with a desired set of competencies, knowledge, experience, or connections in a particular context. | 2012-03-29 |
20120078907 | KEYWORD PRESENTATION APPARATUS AND METHOD - According to one embodiment, a keyword presentation apparatus includes an extraction unit, a selection unit and a clustering unit. The extraction unit is configured to extract, as technical terms, morpheme strings, which are not defined in a general concept dictionary, from a document set. The selection unit is configured to evaluate relevancies between each of basic term candidates and the technical terms, and to preferentially select basic term candidates having high relevancies as basic terms. The clustering unit is configured to calculate weighted sums of statistical degrees of correlation between the basic terms based on the document set, to calculate conceptual degrees of correlation between the basic terms based on the general concept dictionary, and to cluster the basic terms based on the weighted sums. | 2012-03-29 |
20120078908 | PROCESSING A REUSABLE GRAPHIC IN A DOCUMENT - A method and apparatus are provided for processing a graphic in a document so that the graphic may be reused in a different application than the one it was originally used in. For a given document, a graphic may be identified from within the document and extracted from the document. The extracted graphic may be stored in a suitable storage medium, such as a reusable graphic repository. A structural feature associated with the extracted graphic may also be extracted. The extracted graphic may then be classified based on the extracted structural feature. Furthermore, a method and apparatus are provided for generating a reusable graphic from a document. | 2012-03-29 |
20120078909 | INFORMATION SELECT APPARATUS AND INFORMATION SELECT METHOD - According to one embodiment, an information select apparatus includes a storage, an acquisition module, and a selector. The storage is configured to store a script in which at least first information indicative of a search condition of articles, second information indicative of a select condition of articles, and third information indicative of an output order of articles are described, in order to select data which is to be provided to a user. The acquisition module is configured to acquire a data group from a network according to the first information of the script. The selector is configured to select data items from the data group according to the second information of the script, and to orderly arrange the selected data items according to the third information. | 2012-03-29 |
20120078910 | Using an ID Domain to Improve Searching - Methods which use an ID domain to improve searching are described. An embodiment describes an index phase in which an image of a document is converted into the ID domain. This is achieved by dividing the text in the image into elements and mapping each element to an identifier. Similar elements are mapped to the same identifier. Each element in the text is then replaced by the appropriate identifier to create a version of the document in the ID domain. This version may be indexed and searched. Another embodiment describes a query phase in which a query is converted into the ID domain and then used to search an index of identifiers which has been created from collections of documents which have been converted into the ID domain. The conversion of the query may use mappings which were created during the index phase or alternatively may use pre-existing mappings. | 2012-03-29 |
20120078911 | TEXT CLASSIFICATION USING CONCEPT KERNEL - Texts may be classified by mapping the texts to concept space, and by dividing the concept space based on substantive classes. A concept space containing a diverse set of concepts is defined. One example of a concept space is the set of on-line encyclopedia articles, each of which is an example of a concept. A text is scored for relevance against each concept, and a vector is created containing each of the scores. The vector represents the text's position in concept space. For any given substantive class of texts, the concept space may be divided into regions containing texts that are members/non-members of the class. The dividing boundary may be determined by training a classifier on a set of labeled examples of texts that fall inside and outside the class. | 2012-03-29 |
20120078912 | METHOD AND SYSTEM FOR EVENT CORRELATION - A method for event correlation includes receiving events from a network of systems and classifying the events into itemsets, where each itemset includes a set of frequently correlated events. The method also includes calculating a confidence value for each of the itemsets, identifying itemsets whose confidence values conform to a confidence criterion, and varying the confidence criterion to reduce the number of the identified itemsets. A computer program product and data processing system are also disclosed. | 2012-03-29 |
20120078913 | SYSTEM AND METHOD FOR SCHEMA MATCHING - A system and method for matching one or more source schemas with one or more target schemas is provided. The matching between source and target schemas is performed by gathering inputs pertaining to the source and target schemas, wherein the inputs comprises a set of details in a predefined format. Thereafter, the gathered inputs are processed by comparing the source schemas with the target schemas. The processing is performed to identify a set of matches between the source and target schemas based on the linguistic similarity, structural similarity and functional similarity and relationship between the source and target schemas. Subsequently, the identified matches are stored. | 2012-03-29 |
20120078914 | SEARCHABLE SYMMETRIC ENCRYPTION WITH DYNAMIC UPDATING - A Searchable Symmetric Encryption (SSE) mechanism is described which allows efficient dynamic updating of encrypted index information. The encrypted index information includes pointer information that is encrypted using a malleable encryption scheme. The SSE mechanism updates the encrypted index information by modifying at least one instance of the pointer information without decrypting the pointer information, and thereby without revealing the nature of the changes being made. In one implementation, the SSE mechanism includes a main indexing structure and a deletion indexing structure. An updating operation involves patching applied to both the main indexing structure and deletion indexing structure. | 2012-03-29 |
20120078915 | SYSTEMS AND METHODS FOR CLOUD-BASED DIRECTORY SYSTEM BASED ON HASHED VALUES OF PARENT AND CHILD STORAGE LOCATIONS - Embodiments relate to systems and methods for a cloud-based directory system based on hashed values of parent and child storage locations. Platforms and techniques are provided to store a data object to cloud storage resources in two or more locations recorded in a consistent hash structure. A file management tool can store one copy of the data object to a location corresponding to the hashed value of the file path or name, and a second copy to a location corresponding to the hashed value of the parent directory of the data object. All files sharing a common parent directory or other location therefore have at least one copy stored to the same location, in common with the parent. Directory-wide read, write, and/or search operations can therefore be performed more efficiently, since the constituent files of a directory or other location can be accessed from one location rather than distributed locations. | 2012-03-29 |
20120078916 | RANKING SEARCH RESULTS BY SOCIAL RELEVANCY - A location based service with enhanced searching functionality that considers social relevancy in searching for nearby places and analyzing ratings of nearby places. | 2012-03-29 |
20120078917 | Methods And Apparatus For Selecting Updates To Associated Records To Publish On An Information Feed Using Importance Weights In An On-Demand Database Service Environment - Disclosed are systems, apparatus, methods, and computer readable media for selecting updates to associated records to publish on an information feed in an on-demand database service environment. In one embodiment, one or more updates associated with a data record are stored in a database. One or more criteria are applied to the one or more updates to generate an importance weight associated with each update. The one or more importance weights are compared with a designated threshold. When one or more importance weights are identified as meeting or exceeding the designated threshold, the one or more updates associated with the identified one or more importance weights are provided as one or more candidates for publication on an information feed associated with the data record, where the information feed is capable of being displayed on a display device. | 2012-03-29 |
20120078918 | Information Relation Generation - For generating a word space, manual thresholding of word scores is used. Rather than requiring the user to select the threshold arbitrarily or review each word, the user is iteratively requested to indicate the relevance of a given word. Words with greater or lesser scores are labeled in the same way depending upon the response. For determining the relationship between named entities, Latent Dirichlet Allocation (LDA) is performed on text associated with the name entities rather than on an entire document. LDA for relationship mining may include context information and/or supervised learning. | 2012-03-29 |
20120078919 | COMPARISON OF CHARACTER STRINGS - A computer-readable, non-transitory medium storing a character string comparison program is provided. The program causes, when executed by a computer, the computer to perform a process including splitting a first character string and a second character string into words; acquiring information including a semantic attribute that represents a semantic nature of each of the words and a conceptual code that semantically identifies said each of the words, from a storage device; identifying a pair of the words having a common semantic attribute between the first character string and the second character string; comparing the conceptual codes of the specified pair of the words between the first character string and the second character string; and generating a comparison result between the first character string and the second character string based upon a comparison result of the conceptual codes. | 2012-03-29 |
20120078920 | METHOD AND APPARATUS FOR DYNAMIC UPDATE OF DOCUMENT RANK SCORE - Exemplary embodiments of the present invention relate to a method and apparatus for calculating a document rank score of documents in the dynamic World Wide Web (web) environment where documents are continuously added and deleted. The method and apparatus use partial updates to recalculate a document rank score of documents in view of a change, and dynamic updates that reflect a change occurring during calculation of the document rank score. | 2012-03-29 |
20120078921 | METHOD AND SYSTEM FOR AUTOMATIC ANALYSIS OF FAILURE OR STATE MESSAGES - This method for automatic analysis of failure or state messages generated by at least one complex system is characterized in that it comprises the steps for integrating said messages to a database of failure or state messages, and for determining with a computer, for each of said messages, an index of overall interest characterizing a degree of relevance of said message, on the basis of at least one parameter representative of a frequency of occurrence of similar messages in said database, and a correlation between said or each representative parameter and a predefined number of indexes of overall interest. A corresponding analysis system is also provided. | 2012-03-29 |
20120078922 | DATA REORGANIZATION - An approach to efficient data reorganization. The approach may involve searching for control interval (CI) splits and control area (CA) splits in a data component of a VSAM data set. A mapping is created that maps the source location storing the VSAM data set to a target location. The mapping reorders the VSAM data set such that the CI splits and CA splits are removed when the VSAM data set is moved to the target location in accordance with the mapping. Those CAs that do not include CI splits may be moved without using the host devices' processing resources. For example, the storage device may FlashCopy these areas directly from the source location to the target location. Those CAs that do include CI splits may be moved using the host's processing resources. For example, these CAs may be read into the host, re-ordered by the host, and written by the host to the target location. | 2012-03-29 |
20120078923 | SCRIPTING USING NEW ORDERING ALGORITHM - Ordering data objects. The method includes, for each object to be ordered into a set of ordered objects, determining whether the object has static dependencies or dynamic dependencies. A dynamic object is an object that may have circular dependencies. For each static object with only static dependencies, the objects are ordered according to a pre-determined type order. The method further includes, for one or more dynamic objects with dynamic possibly circular dependencies, resolving the circular dependencies such that the dynamic objects can be ordered with the static objects. | 2012-03-29 |
20120078924 | WORKER AND DOCUMENT MANAGEMENT SYSTEM - The method, system and a computer program and a computer product for managing workers and documents is provided. The method includes storing industry representations and a list of workers with data related to the workers, linking the industry representations to the workers and selecting at least one worker from based on the industry representations for that worker. The method also includes scheduling workers to a job based on whether they have all of the required industry representations. In addition, the method includes uploading industry representations and bar code scanning industry representations into the database. The method further includes dispatching said industry representations to other users and automatically mapping fields of the dispatched data in the destination database. In addition, the method includes selectively encrypting only sensitive fields in data transmission between two entities. | 2012-03-29 |
20120078925 | SEARCHING WITHIN LOG FILES - A search tool may search a text file for entries matching one or more search criterions. The search tool may parse the file into entries. Entries may be parsed into lines and fields. A search criterion may define possible content in two or more fields and relationship between the two or more fields. The search criterion may be defined based on an exemplary entry of the text file, such as for example based on a selection of fields of the exemplary entry by a user. | 2012-03-29 |
20120078926 | EFFICIENT PASSAGE RETRIEVAL USING DOCUMENT METADATA - A system, method and computer program product for efficiently retrieving relevant passages to questions based on a corpus of data. A processor device receives an input query and performs a query analysis to obtain searchable query terms. The processor performs: matching metadata associated with one or more documents against the query terms. The document metadata includes one or more of: a title of the documents, one or more user tags or clouds. Then the processor device performs: mapping matched document metadata to corresponding one or more documents; identifying corresponding matched documents to form a subcorpus of documents; and conducting a search in the data subcorpus using the searchable query terms to obtain one or more passages relevant input query from the identified documents. | 2012-03-29 |
20120078927 | LARGE GRAPH MEASUREMENT - As provided herein, a pairwise distance between nodes in a large graph can be determined efficiently. URL-sketches are generated for respective nodes in an index by extracting labels from respective nodes, which provide a reference to a link between the nodes, aggregating the labels into sets for respective nodes, and storing the sets of labels as URL-sketches. Neighborhood-sketches are generated for the respective nodes in the index using the URL-sketches, by determining a neighborhood for a node and generating a sketch using labels that are associated with the respective neighboring nodes. A distance between two nodes is determined by computing an approximate number of paths and an approximate path length between the two nodes, using the neighborhood sketches for the two nodes. | 2012-03-29 |
20120078928 | INTEGRATED CONTENT PUBLISHING - Content objects may be incorporated as metadata in application systems in the same programming environment used to create the rest of the application. Although content objects may be included as part of the application systems, in some instances a central repository storing content object information from each application system may be used to facilitate communication and data sharing between applications. Alternatively, point-to-point communications between applications may also be supported so that applications may share content object data without relying on the central repository. Some embodiments may support both central repository communications and point-to-point communications between applications. Determinations may be made to identify the type of connectivity supported in different circumstances. | 2012-03-29 |
20120078929 | Utilizing Metadata Generated During XML Creation to Enable Parallel XML Processing - A method, computer program product, and system for enabling parallel processing of an XML document without pre-parsing, utilizing metadata associated with the XML document and created at the same time as the XML document. The metadata is used to generate partitions of the XML document at the time of parallel processing, without requiring system-intensive pre-parsing. | 2012-03-29 |
20120078930 | FRAMEWORK FOR EXTREMELY LARGE COMPLEX OBJECTS (XLCOS) - Provided are techniques for receiving multiple data streams having different data formats. The multiple data streams are converted into an Extremely Large Complex Object (XLCO) file by forming multiple XLCO segments corresponding to the multiple data streams, wherein different data formats are stored in different XLCO segments, and wherein different XLCO segments are different sizes. The XLCO segments of the XLCO are stored in different physical file systems having different operating systems. | 2012-03-29 |
20120078931 | METHODS FOR MANAGING OWNERSHIP OF REDUNDANT DATA AND SYSTEMS THEREOF - A storage system according to one embodiment includes a first storage tier; a second storage tier; logic for storing instances of a file in the first storage tier and the second storage tier; logic for associating each instance of the file on the first and second storage tier with a unique program identifier (UPI); logic for receiving a request to access the file or instance thereof from a user in a group of users; logic for searching for a UPI associated with an instance of the file that exists on the first storage tier; and logic for providing the user requesting access to the file with remote access to the instance of the file on the first storage tier. Additional systems, methods, and computer program products are also presented. | 2012-03-29 |
20120078932 | System, Method and Software for Providing Persistent Entity Identification and Linking Entity Information in an Integrated Data Repository - The present invention provides a system, method and software for linking persistent and unique business identifiers, associated with business entities, for associating corresponding business records without a loss of historical records, regardless of subsequent changes, updates, and mergers. In the various embodiments, a first business record, of the plurality of business records, is associated with a first business identifier; and a second business record, which does not match the first record, is associated with a second business identifier. Subsequently, when the first business identifier and the second business identifier are determined to correspond to a singular business entity, the first business identifier and the second business identifier are linked, and respective associations of the first business record and the second business record with the linked first business identifier and second business identifier are maintained, with corresponding source references, and collectively utilized in subsequent search and match determinations. | 2012-03-29 |
20120078933 | DEVICE AND METHOD FOR MONITORING CONTROL CHANNEL IN MULTICARRIER SYSTEM - Provided are a method and a device for monitoring the control channel in a multicarrier system. The terminal determines a plurality of terminal-specific search spaces corresponding respectively to a plurality of scheduled component carriers in a control region within a subframe. The terminal monitors a downlink control channel for the scheduled component carriers corresponding respectively to the plurality of terminal-specific search spaces. | 2012-03-29 |