40th week of 2012 patent applcation highlights part 74 |
Patent application number | Title | Published |
20120254100 | SYSTEMS, METHODS, AND APPARATUSES FOR CLASSIFYING USER ACTIVITY USING TEMPORAL COMBINING IN A MOBILE DEVICE - Components, methods, and apparatuses are provided for determining activity likelihood function values for an activity classification for two or more past epochs based, at least in part, on signals from one or more sensors of a mobile device. A method may comprise, for each of a plurality of activity classifications, determining activity likelihood function values for each of the plurality of activity classifications for two or more past epochs. The activity likelihood function values may be based on signals from one or more sensors of a mobile device. The method may also include combining the activity likelihood function values to determine a likelihood function for an activity classification at a present epoch. The method may also include inferring a present activity of a user co-located with the mobile device to be one of the activity classifications based on the determined likelihood functions for the activity classifications at the present epoch. | 2012-10-04 |
20120254101 | MEDICAL DIAGNOSIS SUPPORT APPARATUS AND MEDICAL DIAGNOSIS SUPPORT METHOD - A medical diagnosis support apparatus which provides information for supporting medical diagnosis includes an inference unit which obtains an inference result based on a combination of already input information and each non-input information, an evaluation unit which evaluates each non-input information by using an inference result on the already input information which is obtained by the inference unit and an inference result on the each non-input information which is obtained by the inference unit, and a selection unit which selects non-input information to be presented from the non-input information based on the evaluation obtained by the evaluation unit. | 2012-10-04 |
20120254102 | SYSTEM AND METHOD TO CALCULATE TIME WEIGHT IN RDF GRAPHS - Method to calculate time weight in an RDF graph, including: providing one or more triples of the RDF graph to an inference engine module, the one or more triples comprising a time information; providing a reference time to the inference engine; calculating an elapsed time from the reference time to the time value; and inversely weighting the time information by the elapsed time to provide a calculated time weight. Another embodiment may provide a method to update a time weight of a relation when an RDF graph has been added to or deleted from the relation. Another embodiment may provide a method to update a time weight of a relation represented by an RDF graph, when a new reference timestamp is provided. Another embodiment may provide a system to calculate time weight in an RDF graph. | 2012-10-04 |
20120254103 | EXTRACT, TRANSFORM AND LOAD USING METADATA - The extract and transformation operation performed on multiple data sources. In the extract operation, a computing system periodically performs an extraction operation on the data sources, perhaps as defined by metadata. The transformation operation is performed on at least some the extracted data, and is periodically performed, perhaps also in a manner that is defined by metadata. When performing each iteration of the transformation operation, the computing system performs a transformation operation on valid data, marks other data as suspect (due to a dependency on data that is not present), and completes transformation on yet other data that had previously been marked as suspect or perhaps reaffirms its suspect status if the needed data is still not available. | 2012-10-04 |
20120254104 | MAINTAINING CLIENT DATA INTEGRITY IN A DISTRIBUTED ENVIRONMENT USING ASYNCHRONOUS DATA SUBMISSION - Data processing architecture where submitters can write data and/or metadata changes to a destination through an asynchronous interface. The architecture includes a ticketing system that issues a ticket (a unique identifier) to the submitter in response to receiving a changelist from the submitter. When the changes are successfully completed at the destination, the cached destination data can be re-downloaded to the submitter, and the changes cached in the submitter, discarded. Absent this capability, a user has to manually manage the cached changes and cached data. The architecture can be distributed in that multiple submitters can submit changelists. The destination provides data integrity by managing submissions to assist in ensuring data integrity across multiple submissions. Automatic changelist cleanup is provided on the submitter so that changelists do not impact performance, memory, and storage. | 2012-10-04 |
20120254105 | Synchronizing Records Between Databases - The described implementations relate to synchronizing records between databases. One implementation can cause historical data of a source database to be recorded as entries on a transaction log and can subsequently cause new data of the source database to be recorded on the transaction log in a same manner as the historical data. This implementation can also identify a distinct attribute associated with an individual entry and generate a message that reflects the individual entry. | 2012-10-04 |
20120254106 | Combination Personal Data Assistant and Personal Computing System Dynamic Memory Reclamation - In order to continually receive messages in a dual personal computer system (PC) and personal digital assistant system (PDA) computer architecture, the PC system is deactivated to conserve battery power while the PDA continues to receive messages. As PDA memory is filled with messages, messages that are synchronized and archived with the PC system are | 2012-10-04 |
20120254107 | HIERARCHICAL MANAGEMENT STORAGE SYSTEM AND STORAGE SYSTEM OPERATING METHOD - The storage system eliminates inconsistency between a stub, and a file data storage location indicated by the stub. In a storage system that executes HSM using stubs, information relating to a higher tier, which is a data migration source, is recorded during data migration. The stub in the higher tier is correctly restored using the higher-tier information thus recorded. The stub is restored, and inconsistency between information in the HSM layers is resolved. | 2012-10-04 |
20120254108 | Synchronization Of Data For A Robotic Device - Technology is described for synchronization of data between a robotic device and a cloud storage service. The method can include identifying data from a robotic device to be synchronized to the cloud storage service. A synchronization request and the data can then be sent to a robotic synchronization service on the robotic device, and the data can be stored on the robotic device's storage system. A further operation can be sending the data to cloud synchronization service. The data can be stored on the cloud storage service. | 2012-10-04 |
20120254109 | DISTRIBUTED COMPONENT RUNTIME - A method of creating a distributed application in a distributed component runtime is disclosed. An application schema including distributed modules is declaratively defined. Each module hosts a component having a corresponding logical address. Mapping the corresponding logical addresses to physical addresses at runtime virtualizes interactions between the components. | 2012-10-04 |
20120254110 | DISTRIBUTED FILE SYSTEM - A computer node connected with an upstream computer node and a downstream computer node so as to be capable of communicating therewith has a replication file system of a master file system, a storing unit, and a controlling unit. The controlling unit receives incremental data showing a changed part of the master file system from the upstream computer node, stores the incremental data into the storing unit, reflects the incremental data on the file system, and transfers the incremental data to the downstream computer node. Moreover, in a case that incremental data for plural times having received from the upstream computer node and having not transferred to the downstream computer node yet are accumulated in the storing unit, the controlling unit merges, with last received incremental data among the incremental data for plural times, the rest of the incremental data for plural times. | 2012-10-04 |
20120254111 | GLOBAL INDEXING WITHIN AN ENTERPRISE OBJECT STORE FILE SYSTEM - A file system is disclosed that includes an application wide name space instantiated in a global index (Gindex) that is used for accessing objects related to an application. Using the Gindex, a method for cache coherency includes establishing one or more appliances, each defining a storage cluster; establishing one or more tenants spanning across appliances, wherein an application stores objects in file systems associated with the appliances and tenants; establishing a Gindex including metadata relating to objects stored in association with the application; replicating the Gindex to plurality of data centers supporting the tenants; storing an original object at a first data center; storing a cached copy of the object at a second data center; aligning the cached copy using metadata for the object from a local copy of the Gindex. | 2012-10-04 |
20120254112 | METHOD AND SYSTEM FOR HOSTING ENTITY-SPECIFIC PHOTO-SHARING WEBSITES FOR ENTITY-SPECIFIC DIGITAL CAMERAS - A system and method for hosting entity-specific photo-sharing websites for entity-specific image capture devices is disclosed. The system and method provides software for the entity-specific image capture devices that causes the image capture devices to transmit entity ID information when the image capture devices transmit images over the Internet. The system and method further provide an online photosharing service capable of hosting the entity-specific photo-sharing websites for each of the entities, such that when the image capture devices connect to photo-sharing service, the photo-sharing service uses the entity ID received from the image capture devices to automatically associate the image with the photo-sharing websites of the identified entity. | 2012-10-04 |
20120254113 | Continuous Content Sharing Through Intelligent Resolution of Federated Hierarchical Graphs - Systems, methods and computer readable media for media for continuous content sharing between systems through intelligent resolution of federated hierarchical graphs are described. A Multi-Topology Middleman (MTM) is used between the source and target systems to handle the content sharing. The MTM builds on traditional import/export infrastructure; it tracks the import/export of individual objects between systems. When a conflict is found between systems, the MTM learns the conflict resolution and stores the conflict resolution as a rule for the conflicting object, and applies the rule for subsequent import/export process on that object. The MTM also tracks the mapping of objects between the source and target systems and updates the target object in accordance with a change in the source object. The MTM is also capable of undoing the import process. | 2012-10-04 |
20120254114 | METHOD AND SYSTEM FOR REPLICATING DATA - Methods, computing environments, and computer program products are provided for replicating data. Point-in-time copy parameters are generated at a primary host site. A side file entry having the point-in-time copy parameters and a track information field (TIF) associated with the point-in-time copy parameters is generated. The side file entry is transferred to a secondary host site. A point-in-time copy process is performed at the secondary host site based on the point-in-time copy parameters and the TIF. | 2012-10-04 |
20120254115 | CREATING SECONDARY COPIES OF DATA BASED ON SEARCHES FOR CONTENT - A method and system for creating secondary copies of data whose contents satisfy searches within data stores is described. In some cases, the system searches for data within a data store, identifies a set of data that satisfies the search, copies the identified set of data, and transfers the copy to secondary or other storage. In some cases, the system utilizes search-based secondary copies of days during restoration processes in order to restore data similar to and/or associated with data requested to be restored. | 2012-10-04 |
20120254116 | Distributed File System - A distributed file system for devices is described. In an embodiment, each data element stored on one of the devices has an associated location and availability attribute. The location attribute is stored co-located with the data element. The availability attribute and a copy of the location attribute are stored by a metadata service. When a client on a device needs to access a data element, it sends a request to the metadata service to find the location of the data element. If the data element is available, this information is provided to the client and this may involve waking a dormant device which holds the data element. Where the data element is not available, read only access may be granted to a cached copy of the data element. Where replication is used and one of the devices holding a replica is unavailable, the system may use write off-loading. | 2012-10-04 |
20120254117 | Reducing a Backup Time of a Backup of Data Files - A mechanism is provided for reducing the backup time of data files from a memory. Data files are pre-staged by identifying the data files in the memory to be backed up to a backup storage system, sorting the data files by size thereby forming a set of small data files and a set of large data files, and copying the set of small data files to a cache while leaving the set of large data files in a disk subsystem. The set of small data files are then backed-up from the cache and the set of large data files are backed-up from the disk subsystem to a backup storage system. Thus, the time required to backup the set of small data files from the cache is performed at a faster rate as compared to backing up the set of large data files from the disk subsystem. | 2012-10-04 |
20120254118 | RECOVERY OF TENANT DATA ACROSS TENANT MOVES - A history of locations of tenant data is maintained. The tenant data comprises data that is currently being used by the tenant and the corresponding backup data. When a tenant's data is changed from one location to another, a location and a time is stored within the history that may be accessed to determine a location of the tenant's data at a specified time. Different operations trigger a storing of a location/time within the history. Generally, an operation that changes a location of the tenant's data triggers the storing of the location within the history (e.g. upgrade of farm, move of tenant, adding a tenant, load balancing of the data, and the like). When tenant data is needed for an operation (e.g. restore), the history may be accessed to determine the location of the data. | 2012-10-04 |
20120254119 | RESTORING COMPUTING ENVIRONMENTS, SUCH AS AUTORECOVERY OF FILE SYSTEMS AT CERTAIN POINTS IN TIME - A method and system for restoring a computing environment from a secondary data store, and facilitating such restoration, is described. In some examples, the system copies the configuration parameters of a computing environment, such as a file system, as well as the data within the file system, and transfers the copies to secondary storage for later restoration. For example, the system may generate an xml file of the configuration parameters of the computing environment when a backup operation of the computing environment is performed, and store the xml file along with copies of the data from the computing environment in secondary storage. | 2012-10-04 |
20120254120 | LOGGING SYSTEM USING PERSISTENT MEMORY - A computer program product, including: a computer readable storage device to store a computer readable program, wherein the computer readable program, when executed by a processor within a computer, causes the computer to perform operations for logging. The operations include: receiving a transaction including data and a log record corresponding to the data; writing the data to a data storage device; and writing the log record to a log space on a persistent memory device coupled to the data storage device. | 2012-10-04 |
20120254121 | SYSTEM AND METHOD FOR GENERATING A THREE-DIMENSIONAL IMAGE - A method for generating three-dimensional image data including accessing, using one or more processors, a first set of data from a database, the first set of data relating to an electronic bill of materials of a product, generating, using one or more processors, a second set of data based on the first set of data that relates to a three-dimensional image of the product, enriching, using one or more processors, the second set of data with a third set of data, the third set of data relating to image information added to the three-dimensional image of the product, and storing, using one or more processors, the enriched second set of data in the database. | 2012-10-04 |
20120254122 | NEAR CONTINUOUS SPACE-EFFICIENT DATA PROTECTION - A method for providing rolling continuous data protection of source data is disclosed. In one embodiment, such a method includes enabling a user to select source data and establish a first interval when point-in-time copies of the source data are generated. The method further enables the user to specify a first number of point-in-time copies to retain at the first interval. The method further enables the user to specify a second number of point-in-time copies to retain at a second interval, wherein the second interval is a (n≧2) multiple of the first interval. The method further enables the user to specify a third number of point-in-time copies to retain at a third interval, wherein the third interval is a (n≧2) multiple of the second interval. A corresponding apparatus and computer program product are also disclosed. | 2012-10-04 |
20120254123 | METHODS AND SYSTEMS FOR SNAPSHOT RECONSTITUTION - A method, computer readable medium, and a system for reconstituting a virtual snapshot of files in a file virtualization system includes forming at a file virtualization device a virtual snapshot that includes a plurality of physical snapshots associated with one or more file storage devices participating in the virtual snapshot, receiving a request for performing an operation on one or more physical snapshots in the plurality of physical snapshots, providing the one or more physical snapshots in response to the request for performing the operation when the one or more physical snapshots exists in the virtual snapshot, and reconstituting the virtual snapshot by including the one or more physical snapshots to form a reconstituted virtual snapshot in response to the request for performing the operation when the one or more physical snapshots do not exist in the virtual snapshot. | 2012-10-04 |
20120254124 | SYSTEM, METHOD, AND COMPUTER PROGRAM PRODUCT FOR DISASTER RECOVERY USING ASYNCHRONOUS MIRRORING - In one embodiment, a computer program product for handling a point-in-time copy (PITC) command includes a computer readable storage medium having computer readable program code embodied therewith. The computer readable program code is configured to: receive a PITC command at a local site, create a data representation that represents updates to make to the at least one target volume of the local target storage location, wherein the updates correspond to changes made to at least one source volume of the local source storage location since execution of an earlier PITC command, create a source data sidefile entry for the at least one source volume, create a target data sidefile entry for the at least one target volume, execute the PITC command at the local site, and create a PITC sidefile entry for the PITC command, the PITC sidefile entry including a timestamp that indicates when the PITC command was executed. | 2012-10-04 |
20120254125 | METHOD AND APPARATUS OF SECURELY PROCESSING DATA FOR FILE BACKUP, DE-DUPLICATION, AND RESTORATION - Disclosed are an apparatus and method of restoring at least one data file. The method may include retrieving the at least one data file to be restored from a data storage location, determining that the at least one data file is a link file, and regenerating a previously exchanged shared secret. The method may also include decrypting a key from the link file using the shared secret, and retrieving data from a data repository location to be restored. | 2012-10-04 |
20120254126 | SYSTEM AND METHOD FOR VERIFYING CONSISTENT POINTS IN FILE SYSTEMS - According to one embodiment, in response to a request for verifying a first prime representing a consistent point of a file system of a storage system having a plurality of storage units, each of a plurality of prime segments collectively representing the first prime is examined to determine whether the corresponding prime segment has been previously verified. Each of the prime segments is stored in one of the storage units, respectively. At least a first of the prime segments that has not been previously verified is verified, without verifying a second of the prime segments that has been previously verified. The first prime, when at least the first prime segment has been successfully verified, can be used to construct the consistent point of the file system. | 2012-10-04 |
20120254127 | COMPUTER-IMPLEMENTED METHOD OF DETERMINING VALIDITY OF A COMMAND LINE - A method of determining a command line validity includes maintaining a block network address database including block network address information; receiving a command line from a terminal of a user; extracting network address information included in the command line; determining whether the network address information is the block network address information, with reference to the block network address database; generating log information associated with the command line in case that the network address information is not the block network address information as the result of the determination, in which the log information comprises at least one of the network address information included in the command line, input time point information with respect to the input time point of the command line, and request content information; recording the log information in a log database; and determining the validity of the command line by using the log information. | 2012-10-04 |
20120254128 | SYSTEM AND METHOD FOR FAST FILE TRACKING AND CHANGE MONITORING - Embodiments are directed towards a dynamic change evaluation mechanism, whereby items having a detected possible change are scheduled for re-evaluation for possible changes at a higher frequency than items detected to not have previously changed, while those items detected as not to have changed are dynamically scheduled for re-evaluation based on an evaluation backlog that may be in turn based, in part, on a time from when an item is assigned an expiration time to when the item is evaluated. In one embodiment, a possibly changed item may be assigned a new expiration time independent of the evaluation backlog. In another embodiment, if no change is detected, then the item may be assigned a new expiration time as a function of a previous expiration time and on the evaluation backlog. | 2012-10-04 |
20120254129 | SYSTEM AND METHOD FOR MANAGING SENSITIVE DATA USING INTELLIGENT MOBILE AGENTS ON A NETWORK - In order to manage stale data on a network of computer systems, a file harvester agent may be configured with a list of stale data files to be deleted. The file harvester agent may be deployed to the computer systems of a network. When executed in a computer system, the file harvester agent searches the file system of the computer system to locate any files or data indicated in the file list. Any located data files are deleted. Once the agent has finished processing the file list on a computer system, the agent can copy or replicate itself to other computer systems of the network in accordance with a pre-configured itinerary. | 2012-10-04 |
20120254130 | SYSTEM AND METHOD FOR MAINTAINING CONSISTENT POINTS IN FILE SYSTEMS USING A PRIME DEPENDENCY LIST - According to one embodiment, a request is received for obtaining a consistent point of data stored in a file system of a storage system having a plurality of storage units. In response to the request, retrieving a prime dependency list from a first prime segment stored in a first of the storage units, where the prime dependency list includes information identifying at least a second prime segment stored in a second of the storage units. The first and second prime segments collectively form a prime segment representing a consistent view of the file system. Each of the prime segments listed in the prime dependency list is ascertained in an attempt to generate the consistent point of data. | 2012-10-04 |
20120254131 | VIRTUAL MACHINE IMAGE CO-MIGRATION - Embodiments of the invention relate to co-migration in a shared pool of resources with similarity across data sets of a migrating application. The data sets are processed and profiled. Metadata is reviewed to remove duplicate elements and to distribute the processing load across available nodes. At the same time, a ranking may be assigned to select metadata to support a prioritized migration. Non-duplicate data chunks are migrated across the shared pool of resources responsive to the assigned prioritization. | 2012-10-04 |
20120254132 | Enhanced Contact Information - A method and an apparatus for organizing information in an electronic address book. The method comprises collecting contact information for an electronic address book, comparing a name from any field in said contact information to a database comprising name information, identifying a first name or a surname from the contact information and relocating in the contact information the identified first name to a field assigned to first names or the surname to a field assigned to surnames as a response to a name identified in a wrong field. | 2012-10-04 |
20120254133 | METHOD FOR BINARY PERSISTENCE IN A SYSTEM PROVIDING OFFERS TO SUBSCRIBERS - A computerized method and system for binary persistence in a system providing offerings to subscribers of a service provider are provided. The method includes receiving a plurality of objects respective of offerings made to a subscriber of a service provider; serializing the plurality of objects beginning at an origin to generate a binary record; and storing the binary record in a binary field of an entry in a database, the entry being respective of the subscriber, wherein retrieval of the offerings made to the subscriber requires merely extraction of the binary record from the binary field and performing at least a partial deserialization thereon. | 2012-10-04 |
20120254134 | Using An Update Feed To Capture and Store Documents for Litigation Hold and Legal Discovery - An electronic discovery archive can continuously pull documents and store them in a way that makes it easy to discover and put documents on litigation hold, independent of the native storage used by a given application. Users can continue to modify documents on litigation hold, and revisions are tracked and saved in the archive to comply with the litigation hold. A legal discovery system can then operate against the archive. | 2012-10-04 |
20120254135 | MULTI-LEVEL VERSION FORMAT - A system and method for maintaining version information. An identifier (“ID”) that identifies a collection of associated files is obtained. An index is generated that specifies the contents of the collection of associated files. The ID may be saved along with the index in a target version file to convey version information about the collection of associated files. Subsequently, the index may be extracted from the target version file to compare with a corresponding index extracted from a reference version file. The result of the comparison may be used to determine whether the contents of the collection of associated files match a reference. | 2012-10-04 |
20120254136 | METHOD AND APPARATUS OF SECURELY PROCESSING DATA FOR FILE BACKUP, DE-DUPLICATION, AND RESTORATION - Disclosed are an apparatus and methods of determining if at least one data file has been de-duplicated. One example method may include receiving a filekey based on at least a portion of the content of the at least one data file, checking a de-duplication registry in a database to determine whether a pre-stored filekey is present, decrypting at least a first data associated with the filekey and at least a second data associated with the pre-stored filekey, and comparing the decrypted at least first data with the decrypted at least second data to determine whether the at least one file has been de-duplicated. | 2012-10-04 |
20120254137 | SYSTEMS AND METHODS TO FACILITATE MULTI-THREADED DATA RETRIEVAL - According to some embodiments, a data source is accessed from which data will be retrieved via a plurality of processing threads. The data source may have, for example, a plurality of records with each record being associated with a plurality of identifiers. Each of the plurality of identifiers may be dynamically evaluated as a potential range identifier, and the evaluation may be based at least in part on a number of distinct values present within each identifier. One of the potential range identifiers may be selected as a selected range identifier, and the plurality of records may be divided into ranges defined using the selected range identifier. | 2012-10-04 |
20120254138 | DATABASE MANAGEMENT METHOD - The present invention realize a method of managing a database capable of hierarchically building master nodes, and efficiently performing the update of the master nodes. A lower-level master node sends, to a higher-level master node, a write set expanded in its own memory including a shadow copy of its own database and a heaptuple map, and the higher-level master node that received the write set verifies whether the update has already been executed and sends the record of this update to the lower-level master node as a transaction log, whereby the database can be updated efficiently and consistently from the lower-level master node to the higher-level master node, and from the higher-level master node to the lower-level master node under its control. | 2012-10-04 |
20120254139 | PROVIDING LOCK-BASED ACCESS TO NODES IN A CONCURRENT LINKED LIST - A method of providing lock-based access to nodes in a concurrent linked list includes providing a plurality of striped lock objects. Each striped lock object is configured to lock at least one of the nodes in the concurrent linked list. An index is computed based on a value stored in a first node to be accessed in the concurrent linked list. A first one of the striped lock objects is identified based on the computed index. The first striped lock object is acquired, thereby locking and providing protected access to the first node. | 2012-10-04 |
20120254140 | DISTRIBUTED, UNIFIED FILE SYSTEM OPERATIONS - Apparatus, systems, and methods may operate to receive a request to access a file from a client node at one of a plurality of lookup nodes, the lookup nodes storing portions of a distributed table having lookup information associated with the file. The distributed table, which may comprise a distributed hash table, includes replicated references to virtualized and non-virtualized file elements of varied granularity in a unified file system. Additional activity may comprise forwarding the request to another one of the lookup nodes until the lookup information is located, or chaining the request to one of the plurality of lookup nodes and implementing activity that has been requested. Additional apparatus, systems, and methods are disclosed. | 2012-10-04 |
20120254141 | COLOR HARMONY WITH PROCESS AND ENVIRONMENTAL FEEDBACK - A computerized system and method for analyzing color consistency on automotive parts and for providing feedback on painting processes occurring in an assembly plant. The system and method facilitates data collection and analysis at numerous points during the assembly paint processes and the identification of possible adjustments so that parts are painted within a specified tolerance. Body and bumper parts are measured during an inspection process. Measurement and colorimetric data is stored in association with an identifier for the body part or bumper. Measurements relate to equipment and paint mix variables as well as environmental variables that influence the paint results. A software application facilitates analysis of the data and troubleshooting possible causes for color discrepancies. As the color trends away from a specified standard, paint process, including environmental, changes are made, prior to the painting of parts in the bumper or body so that color mismatches are prevented. | 2012-10-04 |
20120254142 | INFORMATION DISPLAY METHOD AND SYSTEM EMPLOYING SAME - An information display method comprises retrieving, from at least one database, the information concerning a user and at least one other user, calculating a relationship value for the at least one other user, the relationship value being at least partly based on the retrieved information and using the relationship value as a factor during the display of information relating to the user and the at least one other user. | 2012-10-04 |
20120254143 | NATURAL LANGUAGE QUERYING WITH CASCADED CONDITIONAL RANDOM FIELDS - A natural language query tool comprising cascaded conditional random fields (CRFs) (e.g., a linear-chain CRF and a skip-chain CRF applied sequentially) processes natural language input to produce output that can be used in database searches. For example, cascaded CRFs extract entities from natural language input that correspond to column names or column values in a database, and identify relationships between the extracted entities. A search engine can execute queries based on output from the cascaded CRFs over an inverted index of a database, which can be based on one or more materialized views of the database. Results can be sorted (e.g., according to relevance scores) and presented in a user interface. | 2012-10-04 |
20120254144 | USING NETWORK TRAFFIC LOGS FOR SEARCH ENGINE INDEX UPDATES - A method and apparatus for using network traffic logs for search enhancement is disclosed. According to one embodiment, network usage is tracked by generating log files. These log files among other things indicate the frequency web pages are referenced and modified. These log files or information from these log files can then be used to improve document ranking, improve web crawling, determine tiers in a multi-tiered index, determine where to insert a document in a multi-tiered index, determine link weights, and update a search engine index. | 2012-10-04 |
20120254145 | SEARCH SERVER INTERCONNECTION METHOD, SEARCH SERVER AND SYSTEM FOR MOBILE SEARCH - A search server interconnection method, a search server, and a system for mobile search are disclosed The method includes: sending an information list of a first group of member engines to a search server; receiving an information list of a second group of member engines, where the information list of the second group of member engines is returned by the search server; and sending meta-index information of member engines in the information list of the second group of member engines to the search server. In the present invention, an effective mobile search service across search servers is realized. | 2012-10-04 |
20120254146 | SEARCH ENGINE USING CLIENT BROWSER AND APPLICATION SOFTWARE ACTIVITY INFORMATION - An Internet infrastructure supports searching of web links to select search results by processing browser activity information along with one or more of favorite lists, and related metadata, user profiles, and trends based on browser activity behavior and favorite behavior. A plurality of web browsers located on client device are incorporated with a browser activity-monitoring module that tracks user's Internet usage, processes this information, and sends this information periodically or upon user request to the server to aid in improving search operation results. The search engine server communicatively couples to the plurality of web browsers and supports delivery of search results/web links to the client device based upon a search string, browser activity information, and possibly the favorite lists and related metadata. The gathered browser activity information, favorite lists, and related metadata are stored in one or more server databases that are associated with the search engine server. | 2012-10-04 |
20120254147 | SEARCH ENGINE EMPLOYING PREPROCESSING & FILTERING OF OBJECTIVE ACTIVITY INFORMATION - An Internet infrastructure supports searching of web links to select search results by processing browser activity information along with one or more of favorite lists, and related metadata, user profiles, and trends based on browser activity behavior and favorite behavior. A plurality of web browsers located on client device are incorporated with a browser activity-monitoring module that tracks user's Internet usage, processes this information, and sends this information periodically or upon user request to the server to aid in improving search operation results. The search engine server communicatively couples to the plurality of web browsers and supports delivery of search results/web links to the client device based upon a search string, browser activity information, and possibly the favorite lists and related metadata. The gathered browser activity information, favorite lists, and related metadata are stored in one or more server databases that are associated with the search engine server. | 2012-10-04 |
20120254148 | SERVING MULTIPLE SEARCH INDEXES - Multiple search indexes can be served from a common set of resources. Instead of requiring a processor to be dedicated to serving a single search index, a processor can provide responsive documents for search queries that are based on different ranking algorithms and/or different sets of documents. | 2012-10-04 |
20120254149 | BRAND RESULTS RANKING PROCESS BASED ON DEGREE OF POSITIVE OR NEGATIVE COMMENTS ABOUT BRANDS RELATED TO SEARCH REQUEST TERMS - An automated method is described for displaying brand results in response to a search query. A search query that includes one or more search terms is received at a processor. The one or more search terms are associated with one or more brands. Brand ratings are retrieved for the one or more brands from a memory that stores brand ratings for a plurality of brands. The brand ratings are based upon an analysis of web content items that mention the brands. A web page display of brand results is generated that shows links to one or more web pages of the one or more brands that the one or more search terms are associated with. The links to the one or more web pages of the brands with the most positive brand rating are displayed first. | 2012-10-04 |
20120254150 | DYNAMIC ARRANGEMENT OF E-CIRCULARS IN RAIS (RICH ADS IN SEARCH) ADVERTISEMENTS BASED ON REAL TIME AND PAST USER ACTIVITY - A first advertisement and a second advertisement are served responsive to a search query. User interactions with the query results, such as with the first advertisement, are detected and used as inputs to selecting at least a portion of the second advertisement. User actions can include a hover, a selection, a button selection, or the like. | 2012-10-04 |
20120254151 | SYSTEM AND METHOD FOR KEYWORD EXTRACTION - A computer-implemented system and method for keyword extraction are disclosed. The system in an example embodiment includes a keyword extraction component to extract relevant keywords from content of a web page, to identify items relevant to the extracted keywords, and to rank the relevant items. | 2012-10-04 |
20120254152 | OPTIMIZATION OF SOCIAL MEDIA ENGAGEMENT - Methods for optimizing social media are disclosed. Such methods may include identifying at least one keyword utilized for at least one webpage, identifying social media correspondence referencing the at least one keyword, analyzing content collected from the social media to determine a frequency of references to the at least one keyword and generating at least one report including information based on the analysis. The report may include recommendations for optimizing social media by, for example, purchasing paid posts or links on a social media website. Systems for performing the methods are also disclosed. | 2012-10-04 |
20120254153 | SHORTEST PATH DETERMINATION IN DATABASES - Hub based labeling is used, in databases, to determine a shortest path between two locations. Every point has a set of hubs: this is the label (along with the distance from the point to all those hubs). The hubs are determined that intersect the two labels. This information is used to find the shortest distance. A hub based labeling technique uses, in a database, a preprocessing stage and a query stage. Finding the hubs is performed in the preprocessing stage, and finding the intersecting hubs is performed in the query stage using relational database operators, such as SQL queries. During preprocessing, a forward label and a reverse label are defined for each vertex. The labels are generated using contraction hierarchies that may be guided by shortest path covers. A query, such as an SQL query, is processed using the labels to determine the shortest path. | 2012-10-04 |
20120254154 | PROCESS ARCHITECTURE FOR ELASTIC STATEFUL SHARED NOTHING SYSTEM - A database management system implemented in a cloud computing environment. Operational nodes are assigned as controller-nodes, compute-nodes or storage-nodes. The number of operational nodes, and their assignment as compute-nodes or storage-nodes can vary. Queries specify tables, with each such table assigned to a respective group of storage nodes. The number of operational nodes executing a given query may change by (a) changing the compute-nodegroup associated with a connection, or (b) adding or removing nodes from the compute-nodegroup; and/or distributing data from the tables among the nodes in a storage nodegroup. State information is maintained for each client connection, and recorded for a given connection, so that subsequent steps from the same connection are executed with the state as left by a prior step, and so that subsequent queries on the same connection are executed with the state as left by the prior query | 2012-10-04 |
20120254155 | DUPLICATE SEARCH OPTIMIZATION - A method and system for providing up-to-date monitoring results in a virtual machine environment are described. In one embodiment, a host controller receives a new query pertaining to at least one object in a virtual machine system from a client, and determines whether the new query is similar to any queries previously received from other clients. If the new query is similar to any of the previously received queries, the host controller provides data pertaining to a result of a last execution of the similar query to the client. If the new query is not similar to any of the previously received queries, the host controller executes the new query and provides a result of an execution of the new query to the client. | 2012-10-04 |
20120254156 | Mobile system for collecting and distributing real-estate evaluation reports - The present invention provides an elegant means of interaction between real-estate agents who employ mobile devices, wherein the property evaluation information created by any agent is shared with other agents, and wherein such property evaluations created from and collected from a plurality of mobile devices. In particular, property evaluations created by an agent are forwarded to a service provided in accordance with the present invention to communicate with other agents who may also employ mobile devices to review them. The present invention facilitates an evaluation report that is created by a real-estate agent before a property sale is contracted or agreed to, typically when a property comes to the market for sale, when an agent is able to review the property and create an evaluation report that is sharable with other agents or with other users, such as potential buyers. | 2012-10-04 |
20120254157 | APPARATUS, METHOD AND COMPUTER-READABLE STORAGE MEDIUM FOR RETRIEVING DATA FROM A DATA SOURCE - An apparatus is provided that includes a processor and memory storing executable instructions that in response to execution by the processor cause the apparatus to at least perform a number of operations. The apparatus is caused to receive a rowset of data from a data source, where the rowset includes one or more rows of values from the data source. The apparatus is caused to convert the rowset to markup data, and organize the markup data in preparation for its transformation to an output according to a markup transformation language. The markup data includes, for each row of the rowset, a row markup element; and the organized markup data includes an organization of the row elements into a plurality of logical groups. Even further, the organized markup data may be split into a plurality of smaller markup data sets, which may facilitate transformation of the markup data. | 2012-10-04 |
20120254158 | AGGREGATING PRODUCT REVIEW INFORMATION FOR ELECTRONIC PRODUCT CATALOGS - A product catalog includes information regarding products for sale online by various merchants, including product review information. An analysis module collects product reviews and determines whether each product review includes a product identifier, such as a Global Trade Item Number (“GTIN”). For product reviews having a product identifier, the module adds the product review to the product catalog and associates the product review with the product identifier. For product reviews lacking a product identifier, the module initiates an Internet search using information from the product review and analyzes search results to identify a product identifier for the product review. If the analysis module identifies a product identifier for the product review, the analysis module adds the product review to the product catalog and associates the product review with the identified product identifier. The analysis module may discard product reviews that are not associated with a product identifier. | 2012-10-04 |
20120254159 | System and Method for Displaying and Searching Multimedia Events Scheduling Information - A system for displaying information may include memory, one or more processors, and one or more modules stored in memory. The one or more modules are configured for execution by the one or more processors and may include instructions for: presenting a subset of a collection of data on a first grid having a first axis corresponding to units of time and a second axis, the collection of data comprising data representing time-bounded events; presenting a second grid having, first and second axes corresponding to the first and second axes of the first grid, the second grid corresponding to a larger portion of the collection of data than the subset presented on the first grid; and presenting a user moveable window for selecting a portion of the second grid, and selecting the subset presented on the first grid in accordance with a current position of the window. | 2012-10-04 |
20120254160 | System and Method for Indexing, Searching and Presenting Technical Concepts - A data processing system and method are provided to index, search and present information about defined, “fuzzy” concepts across language, chemical and product identity, composition, biological classification and legal reference. The database system and method permits the use of combinations of concepts, such as labeling, health claims and/or nutritional claims, across linguistic, scientific and legal usages. The user is able to search for concepts in a defined way across any language or means of reference. The definition of the concepts used in the database is accepted as a standard by the database system (user(s). Such standardization then permits one user to pass the results of a search to another user with common meaning, and permits value-added services, such as the capability to provide news services about changes in worldwide regulation of goods and services, i.e., changes in information applicable to the concepts of interest to specific users. | 2012-10-04 |
20120254161 | SYSTEMS AND METHODS FOR PARAGRAPH-BASED DOCUMENT SEARCHING - A computerized method of searching a collection of electronic documents may include comparing search terms to sets of paragraph terms associated with paragraphs in the documents. Search terms and paragraph terms may be standardized, prior to the comparison. The method may also include generating paragraph scores for the paragraphs using term weight values associated with paragraph terms that match search terms, generating paragraph scores for the paragraphs, and using the paragraph scores to generate overall document scores. The method may also include using the overall document scores to determine a set of search results and providing the search results to a display. | 2012-10-04 |
20120254162 | FACET SUPPORT, CLUSTERING FOR CODE QUERY RESULTS - Techniques and tools are described for refining source-code query results. For example, source-code query results for a query can be generated, semantic clusters of the source-code query results can be generated, and based on a selection of a semantic cluster option, refined source-code query results can be sent. Also, for example, source-code query results can be received, selections of facet values associated with groups of the source-code query results can be sent, and based on selected facet values, a subset of the source-code query results can be received. | 2012-10-04 |
20120254163 | DETERMINING A RELATIVE IMPORTANCE AMONG ORDERED LISTS - Implementations and techniques for determining a relative importance among ordered lists are generally discussed. | 2012-10-04 |
20120254164 | SEARCH METHOD, SEARCH DEVICE AND RECORDING MEDIUM - A search device has the following configuration. An extractor extracts extracted document which includes a plurality of search strings among a plurality of document. An acquirer acquires one or more strings from each of said extracted documents, wherein each of acquired strings includes all of said search strings in each of the extracted documents. A priority determinater determines an output priority for each of said extracted document based on length of said acquired strings acquired from the extracted document. An outputter outputs said extracted document in association with said determined output priority. | 2012-10-04 |
20120254165 | METHOD AND SYSTEM FOR COMPARING DOCUMENTS BASED ON DIFFERENT DOCUMENT-SIMILARITY CALCULATION METHODS USING ADAPTIVE WEIGHTING - One embodiment provides a system for comparing documents based on different document-similarity calculation methods using adaptive weighting. During operation, the system receives at least two document-similarity values associated with two documents, wherein the document-similarity values are calculated by different document-similarity calculation methods. The system then determines the weight of a respective document-similarity calculation method for each of the two documents, as well as a weight-combination function for calculating a combined weight of the respective document-similarity calculation method associated with the two documents. Next, the system generates a combined similarity value based on the document-similarity values and the weight-combination function. | 2012-10-04 |
20120254166 | Signature Detection in E-Mails - In an electronic discovery search tool, non-substantive information, such as signatures in e-mail, can bias a search tool and add processing time. A method and system for identifying recurring non-substantive text in documents has been developed so that non-substantive text may be processed or ignored by the search tool, as needed. | 2012-10-04 |
20120254167 | INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, PROGRAM, AND INFORMATION PROCESSING SYSTEM - An information processing apparatus includes an acquisition unit that acquires personal identification information for identifying a person, a control unit that generates correlation information by correlating the personal identification information acquired by the acquisition unit with an environmental impact which is an impact exerted on the environment by the person, and a storage unit that stores the correlation information generated by the control unit. | 2012-10-04 |
20120254168 | PLAYLIST CREATION APPARATUS, PLAYLIST CREATION METHOD AND PLAYLIST CREATING PROGRAM - Disclosed herein is a playlist creation apparatus including a person specification section, a liking extraction section, a searching section, and a playlist creation section. The person specification section is adapted to specify a person captured in an image based on image data. Also, the liking extraction section is adapted to extract a liking of the person specified by said person specification section. The searching section is adapted to search, based on the liking extracted by said liking extraction section, for sound data of sound conforming to the liking. In addition, the a playlist creation section is adapted to create a playlist which defines a reproduction order of the sound data searched out by said searching section during displaying of the image based on the image data. | 2012-10-04 |
20120254169 | GENERATING AND IMPLEMENTING A-LISTS TO MANAGE USER RELATIONSHIPS - Methods, systems, and computer program products for dynamically generating and displaying a contacts list for one or more services of a computing system. The method comprises identifying one or more contacts having associated contact information, the one or more contacts being associated with a user of the computing system, wherein the one or more contacts are identified across one or more information services or sources associated with the computing system; determining a subset of the one or more contacts and associated contact information based on a set of predefined criteria; generating a list of the subset of contacts and associated contact information; and displaying the generated list of contacts and associated contact information on the user interface. | 2012-10-04 |
20120254170 | METHOD AND APPARATUS FOR CONSTRUCTING USER PROFILE USING CONTENT TAG, AND METHOD FOR CONTENT RECOMMENDATION USING THE CONSTRUCTED USER PROFILE - A method of and apparatus for constructing a user profile using a content tag, a method of recommending digital content by using a user profile including a tag included in the digital content and a preference value for the tag. According to the methods and apparatus, a user profile is generated by using a content tag, and thus the taste of the user according to digital content consumption can be expressed in more varied ways. Also, by suggesting a method of generating a tag from web content, construction of a user profile for digital content having no tag is enabled. Furthermore, a tag extracted from digital content used by a user is included in a profile and it can be used for a variety of purposes, such as expansion of a comparison scope, use of preference keywords, providing of content links, and expansion of search scope. | 2012-10-04 |
20120254171 | Exploitation of Correlation Between Original and Desired Data Sequences During Run Generation - A computer executed method of exploiting correlations between original and desired data sequences during run generation comprises, with a processor, adding a number of data values from a data source to a first memory device, the first memory device defining a workspace, determining whether the data values within the workspace should be output in ascending or descending order for a number of runs, and writing a number of the data values as a run to a second memory device in the determined order. | 2012-10-04 |
20120254172 | APPARATUS, METHOD AND COMPUTER-READABLE STORAGE MEDIUMS FOR CLUSTERING AND RANKING A LIST OF MULTIMEDIA OBJECTS - An apparatus is provided that includes a processor and a memory storing executable instructions that in response to execution by the processor cause the apparatus to at least perform a number of functions. The apparatus is caused to direct presentation of a list for a plurality of patients and that is clustered by patient. The apparatus is caused to apply a keyword filter to identify a subset of the patient exams that match the keyword filter, and rank the respective exams by relevance to the keyword filter. The apparatus is caused to direct presentation of a filtered list of patient exams that is clustered by patient in the filtered list of patient exams. And for each patient having patient exams in the subset of the patient exams, the respective patient exams are in ranked order in the filtered list of patient exams according to the keyword filter. | 2012-10-04 |
20120254173 | GROUPING DATA - A computer-executed method for grouping data comprising, with a processor, generating a number of sorted runs from an unsorted input, storing the sorted runs in temporary storage, placing pages of data from the sorted runs, one at a time, into a portion of a buffer allocated to receive that page, and from the allocated portion of the buffer, merging each page of data, one at a time, into a number of aggregated records, the number of aggregated records also being stored in the buffer. | 2012-10-04 |
20120254174 | TIME-BASED DATA PARTITIONING - According to one embodiment, a file system (FS) of a storage system is partitioned into a plurality of FS partitions, where each FS partition stores segments of data files. In response to a request for writing a file to the storage system, the file is stored in a first of the FS partitions that is selected based on a time attribute of the file, such that files having similar time attributes are stored in an identical FS partition. | 2012-10-04 |
20120254175 | SYSTEM AND METHOD FOR OPTIMIZING DATA MIGRATION IN A PARTITIONED DATABASE - According to one aspect, provided is a horizontally scaled database architecture. Partition a database enables efficient distribution of data across a number of systems reducing processing costs associated with multiple machines. According to some aspects, the partitioned database can be manages as a single source interface to handle client requests. Further, it is realized that by identifying and testing key properties, horizontal scaling architectures can be implemented and operated with minimal overhead. In one embodiment, databases can be partitioned in an order preserving manner such that the overhead associated with moving the data for a given partition can be minimized during management of the data and/or database. In one embodiment, splits and migrations operations prioritize zero cost partitions, thereby, reducing computational burden associated with managing a partitioned database. | 2012-10-04 |
20120254176 | SYSTEM AND METHOD FOR STREAK DISCOVERY AND PREDICTION - The disclosed embodiment relates to identifying performance regions in time-series data. An exemplary method comprises identifying, with a computing device, one or more streaks in the time-series data based on at least one streak parameter, ranking, with a computing device, the identified streaks based on at least one characteristic of the identified streaks, and predicting, with a computing device, a future occurrence of at least one streak based on the characteristics of the identified streaks. The steps of identifying and ranking may be carried out using at least one of a linear graph method, a statistical based approach, a curve-line intersection method, and a hypothesis-based method, and the step of predicting the future occurrence of at least one streak may comprise predicting at least one of how long a current streak will continue, when a current streak will end, and when a new streak will begin. The disclosed embodiment also relates to a system and computer-readable code that can be used to implement the exemplary methods. | 2012-10-04 |
20120254177 | Numbering System for Antecedents and Outcomes - A numbering system for antecedents and outcomes providing a method for numbering antecedents and outcomes that reveals underlying information of relationships. The numbering system for antecedents and outcomes utilizes a mathematical relationship and an antecedent's or outcome's existing characterizing information to assign a unique indexing number identifying each antecedent and outcome. In an antecedent numbering system, the unique indexing number is able to provide information about the contributor line number, the cohort, the combination of the preceding multiple antecedents, and the sequence number of the outcome. In an outcomes numbering system, the unique indexing number provides information about the sequence line number, the cohort, the combination of the antecedents, and the order numberof the outcomes. | 2012-10-04 |
20120254178 | SYSTEM AND METHOD FOR PROCESSING AN SQL QUERY MADE AGAINST A RELATIONAL DATABASE - A system and method for processing an SQL query made against a relational database is disclosed. In one example embodiment, the method includes receiving the SQL query made against the relational database. Further, the received SQL query is parsed to obtain each operator and associated one or more operands and sequence of execution of the operators. Furthermore, a closure-friendly operator is dynamically generated for each operator and the associated one or more operands in the received SQL query. In addition, the dynamically generated closure-friendly operators are executed based on the obtained sequence of execution of the operators. | 2012-10-04 |
20120254179 | CLUSTERING CUSTOMERS - A computer implemented method for clustering customers includes receiving a source set of customer records, wherein each customer record represents one customer, and each customer record includes at least one data attribute, and each data attribute has an attribute value; pre-processing the source set of customer records to generate a pre-processed set of customer records; executing a clustering algorithm on the pre-processed set of customer records to group the pre-processed set of customer records into clusters of a pre-defined number. The pre-processing comprises: determining the type of a customer in the source set of customer records; using a type attribute value to indicate the type of the customer in its customer record; normalizing data attribute values and type attribute values; weighting to the data attribute values and the type attribute values respectively to obtain weighted attribute values of the data attribute and weighted attribute values of the tune attribute. | 2012-10-04 |
20120254180 | INTELLIGENT IDENTIFICATION OF MULTIMEDIA CONTENT FOR SYNCHRONIZATION - An intelligent synchronization tool ensures access to desired content in a manner that automatically keeps the content current on the portable media device. A variation threshold or user-specified degree of content variation may be introduced among content downloaded to a user's mobile device to prevent the user from becoming bored. Furthermore, intelligent synchronization may automatically populate the portable media device with popular content to save a user time and/or use passive monitoring techniques to ascertain a user's preferences for subsequent population. | 2012-10-04 |
20120254181 | TEXT, CHARACTER ENCODING AND LANGUAGE RECOGNITION - A method is disclosed, for recognizing whether some electronic data is the digital representation of a piece of text and, if so, in which character encoding it has been encoded. A fingerprint is constructed from the data, wherein the fingerprint comprises, for each of a plurality of predetermined character encoding schemes, at least one confidence value, representing a confidence that the data was encoded using said character encoding scheme. The fingerprint also comprises a frequency value for each of a subset of byte values, each frequency value representing the frequency of occurrence of a respective byte value in the data. A statistical classification of the data is then performed based on the fingerprint. | 2012-10-04 |
20120254182 | PARTITIONING MANAGEMENT OF SYSTEM RESOURCES ACROSS MULTIPLE USERS - A resource group attribute is assigned to a storage resource object representing at least one of the plurality of storage resources in a system configuration of the computing storage environment. The resource group attribute includes a selectable value indicating a resource group object to which the storage resource object is associated. A resource group label is provided in the resource group object and is a string having no wildcards. A user resource scope is assigned to a user ID and a value of the user resource scope provides a mechanism to match to the resource group label. The user ID is authorized to perform one of creating, deleting, modifying, controlling, and managing storage resources with an association to a resource group. | 2012-10-04 |
20120254183 | Method and System for Clustering Data Points - Systems and methods for clustering a group of data points based on a measure of similarity between each pair of data points in the group are provided. A pairwise similarity function can be estimated for each pair of data points in the group. A clustering algorithm can be executed to create clusters and associate data points with the clusters using the pairwise similarity function. The algorithm can be iterated multiple times until a stopping condition is reached in order to reduce variance in the output of the algorithm. The pairwise similarity function for each pair of data points can be updated between iterations of the algorithm and the results of each iteration can be aggregated. The data in each data point associated with a cluster can be consolidated into a consolidated data point. | 2012-10-04 |
20120254184 | Methods And Systems For Analyzing Data Of An Online Social Network - Method of analyzing data from an online social network having a set of network users. The method includes obtaining topic-specific messages sent by the network users. The messages have social content provided by the networks users, wherein the messages include a marker of interest in the social content. The marker of interest is associated with a topic of the social network. The method also includes identifying the network users that sent the messages having the marker of interest in the social content as interested users of the topic. The interested users are a subset of the set of network users. The method also includes determining a topic-specific influence (TSI) value of a designated user from the interested users in the subset. The TSI value of the designated user is based on a number of the interested users that are registered to receive the messages from the designated user. | 2012-10-04 |
20120254185 | METHOD OF CATEGORIZING AN INVENTION WITHIN AN INVENTION LANDSCAPE - A computer-based method is described for categorizing inventions within the context of an invention landscape. A set of key phases is employed based upon the likelihood that the description of the invention to be categorized will share these key phrases with the descriptions of similar inventions from within the invention landscape. The results are ranked in such a way as to enable a tentative assignment of the target invention to one or more categories, and to optionally estimate the value of the invention. | 2012-10-04 |
20120254186 | METHOD AND APPARATUS FOR RENDERING CATEGORIZED LOCATION-BASED SEARCH RESULTS - An approach is provided for rendering categorized location-based results. The approach involves determining a distribution of one or more entities over a geographical area. The approach further involves receiving an input for specifying one or more categories of the one or more entities. The approach also involves processing and/or facilitating a processing of the distribution to generate one or more clusters of the one or more entities with respect to the one or more categories. The approach further involves determining one or more geographical locations associated with the one or more clusters, the one or more entities, or a combination thereof. The approach also involves causing, at least in part, rendering or one or more graphical presentations of the one or more geographical locations, the one or more entities, or a combination thereof based, at least in part, on the one or more clusters. | 2012-10-04 |
20120254187 | METHOD OF CATEGORIZING AN INVENTION WITHIN AN INVENTION LANDSCAPE - A computer-based method is described for categorizing inventions within the context of an invention landscape. A set of key phases and/or semantic properties is employed based upon the likelihood that the description of the invention to be categorized will share these key phrases and/or semantic properties with the descriptions of similar inventions from within the invention landscape. The results are ranked in such a way as to enable a tentative assignment of the target invention to one or more categories, and to optionally estimate the value of the invention. | 2012-10-04 |
20120254188 | CLUSTER-BASED IDENTIFICATION OF NEWS STORIES - Methods, systems, and techniques for cluster-based content recommendation are described. Some embodiments provide a content recommendation system (“CRS”) configured to recommend news stories about events or occurrences. In some embodiments, a news story about an event includes multiple related content items that each include an account of the event and that each reference one or more entities or categories that are represented by the CRS. In one embodiment, the CRS identifies news stories by generating clusters of related content items. Then, in response to a received query that indicates a keyterm, entity, or category, the CRS determines and provides indications of one or more news stories that are relevant to the received query. In some embodiments, at least some of these techniques are employed to implement a news story recommendation facility in an online news service. | 2012-10-04 |
20120254189 | MULTILEVEL INDEXING SYSTEM - A multilevel indexing system for indexing documents including structure and content information. The system may include a structure index module generating a structure index for the documents based on a document structure. A content index module may generate a content index for the documents based on a document type and document content. A computerized tree generation module may generate a multilevel indexing tree including the structure and content indexes. A search into the structure index may drive a search into the content index. | 2012-10-04 |
20120254190 | EXTRACTING METHOD, COMPUTER PRODUCT, EXTRACTING SYSTEM, INFORMATION GENERATING METHOD, AND INFORMATION CONTENTS - An extracting method includes storing to a storage device: files that include character units; first index information indicating which file includes at least one character unit in a character unit group having a usage frequency less than a predetermined frequency and among character units having common information in a predetermined portion, the usage frequency indicating the extent of files having a given character unit; second index information indicating which file includes a first character unit having a usage frequency at least equal to the predetermined frequency and among the character units having common information in a predetermined portion; and referring to the first and second index information to extract a file having character units in the first and second index information, when a request is received for extraction of a file having the first character unit and a second character unit that is included in the character unit group. | 2012-10-04 |
20120254191 | METHOD AND SYSTEM FOR CONCEPT SUMARIZATION - A method and a system for summarizing a concept are provided. A query corresponding to a concept is received from a user. A plurality of images and corresponding descriptive information may be collected based on the query. The plurality of images and the descriptive information may be processed to form feature vectors and processed descriptive information respectively. Further, one or more topics may be identified for the plurality of images. Each of the plurality of images may be assigned with one or more topic distribution values corresponding to the one or more topics. The one or more topics correspond to the processed descriptive information. A sparse set of images may be determined based on the feature vectors and the assigned topic distribution values, to summarize the concept. Also, a target summary may be built from the summarized concept, by regularizing one or more distribution constraints. | 2012-10-04 |
20120254192 | METHOD AND SYSTEM FOR EXTENDED BITMAP INDEXING - A system and method for enhancing bitmap indexing representation of a dataset, which comprises a plurality of cases and features, each case characterized by one or more values of each feature. Currently, the bins vector for each case in the dataset, is a binary array, which is a bitmap indexing representation of each respective feature of the case. The system and method enhance the bitmap indexing by padding each bins vector. The padding is carried out by identifying all target bit locations with a ‘1’ value and replacing at least one ‘0’ bit adjacent to a target bit location with a non-zero numerical value, thereby creating a padded bitmap index. The padding factor may be based on any mathematical or statistical factor concerning population or subpopulation relevant to each of the features of the dataset. | 2012-10-04 |
20120254193 | Processing Data in a Mapreduce Framework - A computer-implemented method for processing input data in a mapreduce framework includes: receiving, in the mapreduce framework, a data processing request for input data; initiating, based on the data processing request, a map operation on the input data by multiple mappers in the mapreduce framework, each of the mappers using an aggregator to partially aggregate the input data into one or more intermediate key/value pairs; initiating a reduce operation on the intermediate key/value pairs by multiple reducers in the mapreduce framework, wherein, without sorting the intermediate key/value pairs, those of the intermediate key/value pairs with a common key are handled by a same one of the reducers, each of the reducers using the aggregator to aggregate the intermediate key/value pairs into one or more output values; and providing the output values in response to the data processing request. | 2012-10-04 |
20120254194 | MANAGEMENT AND STORAGE OF DISTRIBUTED BOOKMARKS - Managing user bookmark information includes receiving a bookmark-related action request and determining a type of action associated with the bookmark-related action request and user information associated with the bookmark-related action request. In the event that the type of action corresponds to an add bookmark action, managing user bookmark information further includes generating a bookmark data record, the bookmark data record comprising the user information and information to be bookmarked; determining, using the user information, bookmark database information associated with a bookmark database to which the bookmark data record is to be stored, the bookmark database being one of a plurality of bookmark databases; generating index information based on the user information and the bookmark database information; storing the index information in an index database that is separate from the plurality of bookmark databases; and storing the bookmark data record in the bookmark database. | 2012-10-04 |
20120254195 | SELF-PRESENTING REPORT - A method, system and computer program product may identify information of interest to form identified points of interest using a report specification, create a master detail relationship using the identified points of interest, apply an order to the identified points of interest, apply annotations to the identified points of interest, apply highlighting to the identified points of interest, generate an enhanced report specification based on at least the order, annotations, or highlighting of the identified points of interest, and execute the enhanced report specification. | 2012-10-04 |
20120254196 | SYSTEMS FOR EVALUATING DIETARY INTAKE AND METHODS OF USING SAME - Systems and methods for ensuring that a child receives proper nutrition specific to the child's developmental stage or pre-existing condition are provided. In a general embodiment, the present disclosure provides systems including a client device having at least one database, which has stored food consumption information and child characteristic information. The database further includes stored nutrient and food group recommendation information, and a rating system. Processors are used to calculate an average daily nutrition value of a child based on the food consumption and child characteristic information, compare the average daily nutrition value to the nutrient and food group recommendation information, and output a rating score based on the comparison. | 2012-10-04 |
20120254197 | OBJECT ACCESS SYSTEM BASED UPON HIERARCHICAL EXTRACTION TREE AND RELATED METHODS - An object access system may include an input component, and a processor coupled to the input component and configured to construct an extraction tree based upon an ordered list of objects, each object having an object description and associated weighted value. The extraction tree may include nodes, each node having a node range for representing a group of objects based upon the respective object descriptions. The nodes may include a parent node, and ordered child nodes associated therewith and having overlapping node ranges. The processor may be configured to traverse the extraction tree, based upon user input from the input component, along an access path from a root node to a terminal node including a selected access object. | 2012-10-04 |
20120254198 | Online Ranking Metric - Methods, systems, and apparatus, including computer program products, for ranking resources. One or more signals reporting one or more actions by the plurality of users related to a respective resource are received, where a reported action is a presentation of the respective resource, an addition of the respective resource, or a deletion of the respective resource. The reported actions include one or more short deletions of the respective resource. A respective long-addition click-through rate (LACTR) is determined for the respective resource based on a number of reported presentations of the respective resource and a difference between a number of reported additions of the respective resource and a number of short deletions of the respective resource. The plurality of resources are ranked based on the respective LACTRs for the plurality of resources. The ranking of the plurality of resources are provided. | 2012-10-04 |
20120254199 | MERGE OPTIMIZATION SYSTEM - A merge optimization system to optimize a run merge process for runs including keys from a data source. The system may include a run generation module to generate a run of the keys in a predetermined order. The system may further include a key characterization module to characterize a distribution of the keys across the run at run generation time, and a run merge module executed by a computer system to selectively associate the runs based on the characterization. | 2012-10-04 |