41st week of 2012 patent applcation highlights part 48 |
Patent application number | Title | Published |
20120259801 | TRANSFER OF LEARNING FOR QUERY CLASSIFICATION - Transfer of learning trains a new domain for the classification of search queries according to different tasks, as well as the generation of a corresponding domain-specific query classifier that may be used to classify the search queries according to the different tasks in the new domain. The transfer of learning may include preparing a new domain to receive classification knowledge from one or more source domains by populating the new domain with preliminary query patterns extracted for a search engine log. The transfer of learning may further include preparing the classification knowledge in each source domain for transfer to the new domain. The classification knowledge in each source domain may then be transferred to the new domain. | 2012-10-11 |
20120259802 | ACTIVE LEARNING OF RECORD MATCHING PACKAGES - An active learning record matching system and method for producing a record matching package that is used to identify pairs of duplicate records. Embodiments of the system and method allow a precision threshold to be specified and then generate a learned record matching package having precision greater than this threshold and a recall close to the best possible recall. Embodiments of the system and method use a blocking technique to restrict the space of record matching packages considered and scale to large inputs. The learning method considers several record matching packages, estimates the precision and recall of the packages, and identifies the package with maximum recall having precision greater than equal to the given precision threshold. A human domain expert labels a sample of record pairs in the output of the package as matches or non-matches and this labeling is used to estimate the precision of the package. | 2012-10-11 |
20120259803 | MULTIPLE TWO-STATE CLASSIFIER OUTPUT FUSION SYSTEM AND METHOD - A system and method for providing more than two levels of classification distinction of a user state are provided. The first and second general states of a user are sensed. The first general state is classified as either a first state or a second state, and the second general state is classified as either a third state or a fourth state. The user state of the user is then classified as one of at least three different classification states. | 2012-10-11 |
20120259804 | RECONFIGURABLE AND CUSTOMIZABLE GENERAL-PURPOSE CIRCUITS FOR NEURAL NETWORKS - A reconfigurable neural network circuit is provided. The reconfigurable neural network circuit comprises an electronic synapse array including multiple synapses interconnecting a plurality of digital electronic neurons. Each neuron comprises an integrator that integrates input spikes and generates a signal when the integrated inputs exceed a threshold. The circuit further comprises a control module for reconfiguring the synapse array. The control module comprises a global final state machine that controls timing for operation of the circuit, and a priority encoder that allows spiking neurons to sequentially access the synapse array. | 2012-10-11 |
20120259805 | INFORMATION ESTIMATION DEVICE, INFORMATION ESTIMATION METHOD, AND COMPUTER-READABLE STORAGE MEDIUM - Disclosed is an information estimation device for estimating an appropriate issue time from a time representation described in a document without intervention of any operator; wherein an information estimation device ( | 2012-10-11 |
20120259806 | User as a Service - Techniques are disclosed for allowing a user to configure profiles to permit interactions with the user based upon varying factors, such as location, mood, time, who the user is with, who is trying to communicate with the user, and other factors. By using a dynamic user profile, the user obtains more control over how and when other people may interact with the user, and how the user interacts with other people. | 2012-10-11 |
20120259807 | PROBABILISTIC SAMPLING USING SEARCH TREES CONSTRAINED BY HEURISTIC BOUNDS - Markov Chain Monte Carlo (MCMC) sampling of elements of a domain to be sampled is performed to generate a set of samples. The MCMC sampling is performed over a search tree of decision sequences representing the domain to be sampled and having terminal nodes corresponding to elements of the domain. In some embodiments the MCMC sampling is performed by Metropolis-Hastings (MH) sampling. The MCMC sampling is constrained using a bound on nodes of the search tree. The constraint may entail detecting a node whose bound value ensures that an acceptable element cannot be identified by continuing traversal of the tree past that node, and terminating the traversal in response. The constraint may entail selecting a node to serve as a starting node for a sampling attempt in accordance with a statistical promise distribution indicating likelihood that following a decision sequence rooted at the node will identify an acceptable element. | 2012-10-11 |
20120259808 | PREDICTING THE OUTCOME OF A CHAOTIC SYSTEM USING LYAPUNOV EXPONENTS - Systems and methods for predicting the outcome of chaotic systems are described. An example of a prediction system disclosed herein includes, in general, functional elements to vary the initial conditions of a chaotic system and calculate a plurality of possible trajectories for the chaotic system. The prediction system also includes calculating a Lyapunov exponent for each of the plurality of possible trajectories and selecting the trajectory with the smallest Lyapunov exponent as the most likely trajectory to occur. | 2012-10-11 |
20120259809 | In-Memory Processing for a Data Warehouse - Embodiments of the present invention include in-memory processing for data warehouse applications. In one embodiment, data records from a data warehouse application are stored in a data storage structure of an in-memory database. Data received from the data warehouse may be stored in a queue and loaded into the data storage structure according to predefined rules. Stored data records are associated with in-memory database transactions that caused the stored data record to be stored, and may further be associated with transactions that caused the stored data records to be changed. A mapping is generated to associate requests from the data warehouse application with in-memory database transactions. The data warehouse application may retrieve data in a change data format calculated on-the-fly. | 2012-10-11 |
20120259810 | METHOD OF MIGRATING STORED DATA AND SYSTEM THEREOF - A method of migrating data from a source storage resource to a destination storage resource involves selecting a source volume in the source storage resource; configuring in the destination storage resource a destination volume corresponding to the source volume and having the same properties; and redirecting I/O requests from an application running on a host to the destination volume instead of the source volume, whilst migrating data stored in the source volume to the destination volume. A storage system is operable as a destination storage system for migrating data from a source storage system, including means for configuring a destination volume corresponding to a source volume in the source storage system and a migration module having a non-transitory computer useable medium and operable to initiate read requests addressed to the source volume thereby enabling a background process of migrating data stored in the source volume to the destination volume. | 2012-10-11 |
20120259811 | CONTENT TRANSFER - The present invention provides a method of transferring content from a file and a database. In this case, the file includes content instances, each content instance being associated with a respective field, and each field having a respective type. The transfer is achieved by determining the type of each field, and then storing each content instance in a store in accordance with the determined field type of the associated field. Each content instance can then be transferred to the database in accordance with the determined field type. A similar procedure is provided for creating XML files based on content within the database. | 2012-10-11 |
20120259812 | Cooperative Naming for Configuration Items in a Distributed Configuration Management Database Environment - Disclosed are methods and systems to provide coordinated identification of data items across a plurality of distributed data storage repositories (datastores). In one disclosed embodiment, a single configuration management database (CMDB) controls identification rights for all CIs as they are first identified in a master/slave relationship with all other CMDBs in the distributed environment. In a second embodiment, a plurality of CMDBs divide identification rights based upon coordination identification rules where certain CMDBs are assigned authoritative identification rights for CIs matching the rules of a particular CMDB in the distributed environment. In a third embodiment, one or more of the plurality of CMDBs may also have advisory identification rights for CIs which do not already have an identifiable unique identity and can coordinate with an authoritative CMDB to establish an identity for CIs. | 2012-10-11 |
20120259813 | INFORMATION PROCESSING SYSTEM AND DATA PROCESSING METHOD - The file synchronization processing among sites which can reduce the response time is realized. By the CAS device creating a list of at least a part of the file groups which the first sub-computer system archived or backed up to the data center as an update list and transferring the update list to the second sub-computer system, the second sub-computer system determines whether the file is valid or not by using the update list (See FIG. | 2012-10-11 |
20120259814 | SYSTEM AND METHOD FOR MONITORING COMPUTER SYSTEM RESOURCE PERFORMANCE - According to the present invention, policies are prepared for a plurality of resources residing in a computer system comprising a storage system for copying data from a copy source volume to a copy target volume, and an evaluation is carried out for an evaluation-target resource of the plurality of resources for determining whether or not to execute a predefined action based on the policy of this evaluation-target resource. A policy corresponding to a resource related to copying of the plurality of resources is determined based on a time period related to the copying. | 2012-10-11 |
20120259815 | Reusing Snapshots in a Network Data Management Protocol Backup Operation - Mechanisms, in a data processing system, are provided for performing a data management operation. These mechanisms identify one or more defined groups of data elements that are a target of the data management operation. One or more previously generated snapshot files associated with the one or more defined groups are identified and a determination is made as to whether at least one previously generated snapshot file of the one or more previously generated snapshot files associated with the one or more defined groups is able to be reused when performing the data management operation. The data management operation is performed based on the determination of whether at least one previously generated snapshot file of the one or more previously generated snapshot files associated with the one or more defined groups is able to be reused when performing the data management operation. | 2012-10-11 |
20120259816 | CHECKPOINTS FOR A FILE SYSTEM - Aspects of the subject matter described herein relate to checkpoints for a file system. In aspects, updates to the file system are organized into checkpoint buckets. When a checkpoint is desired, subsequent updates are directed to another checkpoint bucket. After global tables have been updated for updates in the current checkpoint bucket, a logical copy of the global tables is created. This logical copy is stored as part of the checkpoint data. To assist in recovery, a checkpoint manager may wait until all updates of the current checkpoint bucket have been written to storage before writing final checkpoint data to storage. This final checkpoint data may refer to the logical copy of the global tables and include a validation code to verify that the checkpoint data is correct. | 2012-10-11 |
20120259817 | Utilizing Metadata to Optimize Efficiency for Archiving Emails - A method, a computer program product and a system are provided for archiving emails, where the email system includes at least one user mailbox configured to receive and store emails within the user mailbox and send emails from the user mailbox. User-specific metadata corresponding with emails received and sent by each user mailbox is collected. The collected user-specific metadata is analyzed to provide a predictive indication when and which emails will be archived for each user mailbox, and emails are archived for user mailboxes based upon the predictive indication for each user mailbox. | 2012-10-11 |
20120259818 | System And Method For Hierarchical Recovery Of A Cluster File System - Hierarchical recovery of failed computing nodes to operative computing nodes within a cluster of computing nodes is managed by initiating a recovery leader at an operative node that retrieves management information from the operative nodes and applies the management information to recover filesets of a meta-fileset in a hierarchical filesystem. The use of hierarchical filesets throughout the cluster provides more rapid failover by distributing recovery load across computing nodes and supporting recovery of nodes in parallel. | 2012-10-11 |
20120259819 | METHOD AND SYSTEM FOR PERFORMING A CLEAN FILE LOCK RECOVERY DURING A NETWORK FILESYSTEM SERVER MIGRATION OR FAILOVER - A method for file lock recovery in a distributed computer system. The method includes executing a distributed computer system having a plurality of nodes comprising a cluster, and initiating a network file system server migration from one node of the cluster to a different node of the cluster. A migration count is incremented, wherein the migration count is stored at each of the nodes comprising the cluster. File lock services are paused at each of the nodes comprising the cluster. The network file system server migration is completed at the different node of the cluster. The migration count is then decremented in response to the completion. File lock services are then resumed at each of the nodes comprising cluster. | 2012-10-11 |
20120259820 | METHOD AND SYSTEM FOR RESTARTING FILE LOCK SERVICES AT AN ADOPTIVE NODE DURING A NETWORK FILESYSTEM SERVER MIGRATION OR FAILOVER - A method for file lock recovery in a distributed computer system. The method includes executing a distributed computer system having a plurality of nodes comprising a cluster, and initiating a network file system server fail over from one node of the cluster to an adoptive node of the cluster. File lock services are then stopped at the adoptive node. File lock services are subsequently restarted at the adoptive node, wherein the restart causes the adoptive node to commence a grace period for other network file system clients to connect to the adoptive node and reclaim file locks. After restarting file lock services, a cluster file system is updated on the adoptive node with process identifiers, and file lock services are resumed at the adoptive node. The cluster file system can be simultaneously exposing the file lock services to other clients as well, like CIFS, etc. | 2012-10-11 |
20120259821 | MAINTAINING CACHES OF OBJECT LOCATION INFORMATION IN GATEWAY COMPUTING DEVICES USING MULTICAST MESSAGES - Example embodiments relate to maintaining caches of object location information in gateway computing devices using multicast messages. In example embodiments, upon updating a cache with an object identifier and a corresponding object location, a gateway computing device may transmit an update message using a simple multicast transport protocol to a plurality of other gateway computing devices. In contrast, upon deleting an object from a cache, the gateway computing device may transmit a delete message using a reliable multicast transport protocol to the plurality of other gateway computing devices. | 2012-10-11 |
20120259822 | METHOD FOR COMPRESSING IDENTIFIERS - The invention relates to a method for compressing identifiers of program code elements in a portable data carrier, to a method for calling compressed identifiers, to a portable data carrier, and to a semiconductor chip having a memory area for storing the compressed identifiers. | 2012-10-11 |
20120259823 | PARTITIONING A DIRECTORY WHILE ACCESSING THE DIRECTORY - A process for reading entries in a directory is initiated. A first index is maintained to indicate how far the read has progressed in the directory. If, during execution of the process, the directory is partitioned into subdirectories, then a second index is maintained for each of the subdirectories to indicate how far the read has progressed in each of the subdirectories. A third index that indicates how far the read has progressed in the partitioned directory is also maintained. | 2012-10-11 |
20120259824 | MAINTAINING INDEX DATA IN A DATABASE - In a particular embodiment, a method includes storing, at a staging table of a database, a data update generated based on a transaction performed with respect to a data table that is associated with one or more indexes. Each index of the one or more indexes is maintained externally to the database. The method further includes maintaining the data update at the staging table at least until index update data is received at the database. The index update data represents a modification, based on the data update, to a particular index of the one or more the indexes. | 2012-10-11 |
20120259825 | DATA MANAGEMENT METHOD AND DATA MANAGEMENT SYSTEM - A data management system respectively computes first hash values while sliding a window a prescribed amount at a time with respect to a prescribed range from a start location of a data block to a prescribed size. The system extracts, from among the first hash values, a first hash value, which is equivalent to a characteristic value, and partitions the data block into a first chunk of data at a location corresponding to this first hash value. The system determines coincidence between a first chunk of data and a stored second chunk of data, and prevents duplicate data from being stored twice. | 2012-10-11 |
20120259826 | Customizable Interfacing Agents, Systems, And Methods - Customizable interfacing agents, systems, and methods are provided. In one embodiment, a method for interfacing a user to service providers includes receiving a set of user attributes associated, with a user to form a user profile, receiving a request for data from the user, and sending the request to one or more service providers. The method also includes receiving response data from the one or more service providers in response to sending the request to the one or more service providers. The method also includes filtering the response data from the one or more service providers using the user profile to form user-customized response data, and presenting the user-customized response data to the user. | 2012-10-11 |
20120259827 | SYSTEM FOR MULTIPLE TASKS ON A DISPLAY - A system has a processor and tangible, non-transistory media that stores a program that when executed by the processor is configured to perform operations. The system receives a request from a requesting user to reconfigure a search screen on a display, adds at least one search window to the search screen; receives a plurality of search requests from the search screen, and performs a plurality of searches to perform a separate search resulting in separate search results for each of the search requests provided by the requesting user. Each of the search results is displayed on a separate frame on a display. Other embodiments include operations other than searches. | 2012-10-11 |
20120259828 | NETWORK SEARCH ENGINE USING OBJECTIVE AND SUBJECTIVE USER FAVORITES FOR SEARCHING - An Internet infrastructure that supports search operations that are restricted by user favorite lists, related user metadata, and user trends that are based on client-stored user favorite behavior. The Internet infrastructure contains a search engine server coupled to a plurality of web browsers resident on client devices that contain user/favorite lists and metadata. The search engine supports delivery of search result web links to the client device based upon a search string, favorite list, and related metadata. The search engine server gathers favorite lists and related metadata from the plurality of web browsers, anonymously and with user permission. The search engine server stores the gathered favorite lists and related metadata in a database that is associated with the search engine server, and delivers search results based upon the search string by putting restrictions on search results based upon stored data in the database. | 2012-10-11 |
20120259829 | GENERATING RELATED INPUT SUGGESTIONS - Methods, systems, and apparatus, including computer program products, for generating search query suggestions. In one aspect, a method includes receiving query and label data, the data including a plurality of queries and, for each query, specifying one or more labels associated with the query, where the queries are n grams submitted by users of a search engine and the labels identify a category or topic in which an associated query belongs; generating a suggestion resource, including: identifying unique labels in the query and label data; and for each unique label: indexing the unique label; identifying in the query and label data, each query associated with the unique label; and associating, in the suggestion resource, the identified queries with the unique label; and storing the suggestion resource in a computer readable medium. | 2012-10-11 |
20120259830 | WHOIS SERVER VERIFYING WHOIS RECORDS AND SEARCH ENGINE ACCESSES - A system and method monitors and weeds out illegitimate/illegal websites during search engine indexing and domain name registration. The whois database generated during domain name registration is used as a reference database for correlation with a database generated by the search crawler on a search engine server. A whois analyzer from the search engine server extracts a set of URLs into a database called the uncorrelated URL database. The uncorrelated URL database contains those URLs from both the aggregate whois database and reverse index database after removing common URLs. The uncorrelated URLs are contacted and advised by the whois administrator to take necessary action to be listed in the whois database and properly be indexed during search engine crawling. This process ensures that every URL is properly registered and identified on the Internet thus eliminating the success of illegal/unwanted websites. | 2012-10-11 |
20120259831 | User Information Needs Based Data Selection - Techniques for determining user information needs and selecting data based on user information needs are described herein. The present disclosure describes extracting topics of interests to users from multiple sources including search log data and social network website, and assigns a budget to each topic to stipulate the quota of data to be selected for each topic. The present disclosure also describes calculating similarities between gathered data and the topics, and selecting top related data with each topic subject to limit of the budget. A search engine may use the techniques described here to select data for its index. | 2012-10-11 |
20120259832 | SYSTEM FOR HANDLING A BROKEN UNIFORM RESOURCE LOCATOR - A method and apparatus for receiving a request for a Uniform Resource Locator (URL), determining the URL is broken, retrieving query data from a first database mapping the broken URL to the query data and retrieving one or more substitute URLs from a second database mapping the broken URL to the query data. | 2012-10-11 |
20120259833 | CONFIGURABLE WEB CRAWLER - A configurable web crawler allows a user configure a web crawl by specifying one or more of thread throttling rules, domain restriction rules, and crawling rules. The configurable web crawler crawls the web beginning with a seed uniform resource locator and according to the crawl configuration. | 2012-10-11 |
20120259834 | INDEXING AND SEARCHING OF ELECTRONIC MESSAGE TRANSMISSION THREAD SETS - A method is carried out by storing information describing configurations of discussion threads formed of respective series of EMTs that are exchanged among at least two individuals. The discussion threads have a root EMT, zero or more reply EMTs, and a last offspring EMT. The method is further carried out by compacting the EMT discussion threads, and indexing the compacted EMT discussion threads. | 2012-10-11 |
20120259835 | ELECTRONIC DOCUMENTATION - An embodiment of a method includes receiving a selection of an original content item, deriving a supplemental content item from the original content item, designating a unique identifier to the supplemental content item, and inserting a reference including the unique identifier into the primary document. A system includes a candidate content item repository having one or more content items that can be included in a structured electronic document, a copy module configured to derive a base supplemental content item from a selected one of the candidate content items and further configured to designate a unique identifier for the base supplemental content item, and a document editor configured to receive the unique identifier and insert the unique identifier into a reference to the base supplemental content in the primary document. | 2012-10-11 |
20120259836 | Analyzing XML Data - Embodiments of the invention disclose a method, a system and a computer program product of discovering automated insights in XML data by generating a query result in response to querying data using a query, wherein the data is in a markup language format, and identifying a pattern associated with the query result, wherein the data in the markup language format is used for pattern identification. | 2012-10-11 |
20120259837 | Analyzing XML Data - Embodiments of the invention disclose a method, a system and a computer program product of discovering automated insights in XML data by generating a query result in response to querying data using a query, wherein the data is in a markup language format, and identifying a pattern associated with the query result, wherein the data in the markup language format is used for pattern identification. | 2012-10-11 |
20120259838 | DATABASE MANAGEMENT SYSTEM AND METHOD - A database management system has a query interface for receiving a query and a query executor for executing the received query. The query executor dynamically generates a task, and executes a plurality of tasks in parallel. In execution of each task, each time data is required to be read from a database, the query executor generates a task for acquiring the data, and in execution of the generated task, issues a data read request for reading the data from the database, to thereby shorten a time taken to execute each task. | 2012-10-11 |
20120259839 | FIREWALLS FOR SECURING CUSTOMER DATA IN A MULTI-TENANT ENVIRONMENT - Network security is enhanced in a multi-tenant database network environment using a query plan detection module to continually poll the database system to locate and raise an alert for suspect query plans. Security also can be enhanced using a firewall system sitting between the application servers and the client systems that records user and organization information for each client request received, compares this with information included in a response from an application server, and verifies that the response is being sent to the appropriate user. Security also can be enhanced using a client-side firewall system with logic executing on the client system that verifies whether a response from an application server is being sent to the appropriate user system by comparing user and organization id information stored at the client with similar information in the response. | 2012-10-11 |
20120259840 | SYSTEM AND METHOD FOR ENHANCED QUERY OPTIMIZER SEARCH SPACE ORDERING - In an optimizer within a Relational Database Management System improved ways in which a search space (the universe of possible join combinations) is generated and managed and improved ways in which the elements of a search space are evaluated so that among other things unpromising elements are efficiently dropped (pruned). | 2012-10-11 |
20120259841 | PRIORITY DIMENSIONAL DATA CONVERSION PATH REPORTING - Methods, systems, and apparatuses, including computer programs encoded on a computer storage medium, for providing data related to conversion paths. In one aspect, a plurality of conversion paths are received. Each conversion path includes one or more user interactions that include a plurality of dimensional data. A priority sorted list of dimensions is received and dimensional data is selected from each user interaction based on the sort list of dimensions. Each conversion path is converted into a dimensional path, and each dimensional path includes dimensional elements that corresponds to user interactions of the conversion path. Each dimensional element comprises the selected dimensional data from the corresponding user interaction. The plurality of dimensional paths are aggregated together based upon the number of dimensional elements within each dimensional path and the dimensional data of the dimensional elements. Reports can be generated using the aggregated dimensional data. | 2012-10-11 |
20120259842 | System and Methods for Targeted Event Detection and Notification - A system and method for targeted event detection and notification based on combinations of time, location and context. A database stores information about users of the system including profile information, and information about real world events such as date, time, and event information. Events are tagged with information that allows searching. A suggestion engine matches particular events to particular users. Events are private (individually), private to groups, and public. A third party such as merchant or advertiser can generate and publish events to users who possess specified profiles. User information is de-identified to address privacy concerns. Users are provided with notifications of events or offers that meet their interest profiles and may accept such events or offers to their calendars, reminder list, timeline or otherwise. | 2012-10-11 |
20120259843 | DATABASE ACCELERATION USING GPU AND MULTICORE CPU SYSTEMS AND METHODS - A computer-implemented method for GPU acceleration of a database system, the method includes a) executing a parallelized query against a database using a database server, the parallelized query including an operation using a particular stored procedure available to the database server that includes a GPU/Many-Core Kernel executable; and b) executing the particular stored procedure on one or more GPU/Many-Core devices. | 2012-10-11 |
20120259844 | METHODS AND SYSTEMS FOR ASSESSING EXCESSIVE ACCESSORY LISTINGS IN SEARCH RESULTS - A system and method for assessing excessive accessory listings in search results includes a processor-implemented textual mining module that parses a data field of a document and generates at least one token from the data field. A processor-implemented scoring module calculates a score for the at least one token, with the at least one token score representing a likelihood that the at least one token belongs to one of two binary classifications. The processor-implemented scoring module also calculates a score for the document based on the at least one token score, with the document score representing a probability of the document being in one of the two binary classifications. A processor-implemented decision tree module inputs the document score and document attribute values into a decision tree and generates an output representing a refined score based on the document score and at least one of the document attribute values. | 2012-10-11 |
20120259845 | Method of Providing Instructional Material While A Software Application is in Use - An ambient help application selects and displays learning resources to an end-user of a software application that are relevant to the current activities of the end-user in the software application. The ambient help application selects the learning resources based on computed relevance scores of each learning resource and displays the learning resources in a dedicated help space. The learning resources may include video- and text-based instructional information, and may be sized and positioned in the help space according to relevance score. | 2012-10-11 |
20120259846 | METHOD FOR SELECTING A SUBSET OF CONTENT SOURCES FROM A COLLECTION OF CONTENT SOURCES - A method for selecting a subset of content sources from a collection of content sources is disclosed. A server retrieves, in response to a plurality of queries on a topic from a client, using a programmed computer, a plurality of sets of documents from the collection of content sources. The server enumerates all subsets of the plurality of sets of documents. The server calculates, for each subset, a count of effectiveness of a subset and a price of the subset. The server selects a subset having the highest calculated ratio of count of effectiveness of the subset to price of the subset. The server delivers the selected subset of the plurality of sets of documents to the client. | 2012-10-11 |
20120259847 | Collaborative Data Appliance - A modular appliance based architecture is disclosed that allows for database consolidation and systems integration. The collaborative data appliance comprises modules designed to collect and combine data which is relevant to the user, uniquely arranging the data into meaningful views which can be later customized into a multitude of reports. The appliance utilizes a customized data code that allows the appliance to span the disparate databases it will consolidate. The appliance also allows a user to share information across systems in a heterogeneous environment by replicating data between different hardware platforms and data sources, without losing the integrity of the data. Further, the appliance comprises a discovery engine that utilizes Artificial Intelligence (AI), and that requires User Input (UI). | 2012-10-11 |
20120259848 | SYSTEM AND METHOD FOR AUTOMATICALLY BUILDING A SEARCH DATABASE FOR DIGITAL DATA OF MEDIUMS - A method for automatically building a search database for digital data of mediums by executing a software program stored in a memory of a computer, the method comprising: receiving a first request for selecting files to be processed; receiving a second request for selecting a target medium; and creating a search database for the selected files according to the target medium. | 2012-10-11 |
20120259849 | DETERMINING FILE OWNERSHIP OF ACTIVE AND INACTIVE FILES BASED ON FILE ACCESS HISTORY - File management systems and methods are presented. In one embodiment, implementation of a method for determining the accurate ownership of a file within a data system includes: identifying a first plurality of access events for a file, wherein the file is associated with a directory of related files; identifying a second plurality of access events for the related files within the directory, wherein access events in the first and second plurality of access events occur within a period; determining a pool of users accessing files within the directory within the period; and selecting a user from the pool of users as an inferred owner of the file based on access metrics related to the plurality of access events. | 2012-10-11 |
20120259850 | EFFICIENT QUERY CLUSTERING USING MULTI-PARTITE GRAPHS - Efficient search query clustering using tripartite graphs may enable a search engine developer to model information needs of users while expending less computing resources. The efficient clustering of search queries may involve multiple computing devices receiving a subgraph of a multi-partite graph that encompasses search queries, as well as receiving a global center vector table that includes cluster center entries for query clusters. At each computing device, the received global center vector table may be filtered to eliminate one or more cluster center entries that are irrelevant to the search queries. Subsequently, the search queries may be clustered into the query clusters by at least using the filtered global center vector table at each of the computing devices. In some instances, one or more comparisons between search queries and the cluster center entries in the global center vector table during the clustering may be eliminated. | 2012-10-11 |
20120259851 | AGGREGATION OF CONVERSION PATHS UTILIZING USER INTERACTION GROUPING - Methods, systems, and apparatuses, including computer programs encoded on computer-readable media, for aggregating conversion paths utilizing user interaction grouping. In one aspect, information regarding a plurality of conversion paths is received. Each conversion path includes one or more user interactions that include a plurality of dimensional data. A sorted list of grouping definitions that includes one or more group rules is received and the conversion paths are converted into group paths based upon the one or more group rules. Each group path includes one or more group elements corresponding to each user interaction of a corresponding conversion path. The plurality of group paths are aggregated based upon the number and order of group elements within each group path. Information regarding the aggregated group paths can then be provided, for example, through a report. | 2012-10-11 |
20120259852 | METHOD AND APPARATUS FOR PUSHING SITUATIONALLY RELEVANT DATA - A computer-implemented method of providing users with contextually relevant data associates metadata tags with data items extracted from a variety of data sources that summarize the data items in searchable form using a common format. Contextual data is collected from the users indicative of their current situation. This data is then correlated with the metadata tags to identify data items of potential interest to the users taking into account their current situation. The identified data items are pushed to the relevant receiving devices in real time over a communications network to provide the identified users with information relevant to their current situation. | 2012-10-11 |
20120259853 | Real Time Association of Related Breaking News Stories Across Different Content Providers - Methods and systems for relating breaking news stories across content providers include receiving a breaking news headline for a breaking news from a content provider. The breaking news headline is tokenized in substantial real time by identifying a plurality of headline tokens. A plurality of news stories is received from a plurality of content providers. Each of the plurality of news stories is tokenized to identify a plurality of story tokens. The plurality of headline tokens and story tokens are analyzed to determine if one or more of the news stories are related to the breaking news headline. Based on the analysis, one or more of the news stories are mapped to the breaking news headline. The mapping enables presentation of the one or more news stories from one or more of the content providers while rendering the breaking news headline. | 2012-10-11 |
20120259854 | Conversion Path Based Segmentation - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium including receiving user interaction data, wherein the user interaction specifies user interactions with content items and conversion items. A conversion item is a user action that satisfies a predetermined conversion criteria. The method includes receiving conversion data including conversion path data for a plurality of conversion paths, wherein each conversion path includes user interaction data prior to and including a conversion event. The method includes determining a first interaction, an assist interaction or a last interaction with content items for the conversion event. The method includes providing an ability to define a segment, using a processor, the conversion path data based on path-level dimensions and path-level metrics. | 2012-10-11 |
20120259855 | DOCUMENT CLUSTERING SYSTEM, DOCUMENT CLUSTERING METHOD, AND RECORDING MEDIUM - In the provided document clustering system ( | 2012-10-11 |
20120259856 | CATEGORIZING OBJECTS, SUCH AS DOCUMENTS AND/OR CLUSTERS, WITH RESPECT TO A TAXONOMY AND DATA STRUCTURES DERIVED FROM SUCH CATEGORIZATION - A Website may be automatically categorized by (a) accepting Website information, (b) determining a set of scored clusters (e.g., semantic, term co-occurrence, etc.) for the Website using the Website information, and (c) determining at least one category (e.g., a vertical category) of a predefined taxonomy using at least some of the set of clusters. | 2012-10-11 |
20120259857 | METHOD AND SYSTEM FOR GATHERING, ANALYZING AND DISSEMINATING MIND-BASED PERCEPTIONS - Data pertaining to mind-based perceptions is gathered from numerous sources via computer and, using statistical techniques, mind-based perceptions that are commonly occurring are identified. By considering mind-based perceptions from multiple sources that are repeated with a frequency above a certain threshold level, investigators can focus on events that are commonly-appearing at any given time, thereby filtering out much of the “noise” that could be associated with one-time or reoccurring-but-not-specific. | 2012-10-11 |
20120259858 | METHOD AND APPARATUS PROVIDING OMNIBUS VIEW OF ONLINE AND OFFLINE CONTENT OF VARIOUS FILE TYPES AND SOURCES - An online service provider (OSP) operates online data centers to store members' data objects relating to various online member services of the OSP. An aggregated catalog lists members' data objects residing in the online data centers and also those residing in member computers' local storage. An aggregator monitors contents of the online storage facilities to detect new storage of prescribed types of data objects owned by the members, and also communicates with member computers to identify prescribed types of data objects newly stored in the respective local storage. The aggregator updates the aggregated catalog to list the newly stored data objects. Responsive to a request by a member, a finder searches the aggregated catalog and utilizes results of the search to provide, for display at the requesting member's computer, a consolidated listing of online data objects and locally stored data objects owned by the requesting member. | 2012-10-11 |
20120259859 | METHOD FOR RECOMMENDING BEST INFORMATION IN REAL TIME BY APPROPRIATELY OBTAINING GIST OF WEB PAGE AND USER'S PREFERENCE - Disclosed is an information recommendation method for providing a construction method for a classified word database capable of rapidly accommodating changes in associations between words. The disclosed information recommendation method basically is based on the finding that, by analyzing occurrence frequency information of an arbitrary word in a Web site having an arbitrary classified word in real-time and obtaining the real-time degree of similarity between the classified word and the arbitrary word, it is possible to construct a database that is capable of being sensitive in responding to changes in associations between words. The disclosed information recommendation method relates to a method of extracting classified words indicating a main idea of text included in a Web page, accumulating the classified words, and constructing a real-time tag database; an information recommendation method for using the tag database to reflect the main idea of the Web page in real-time; and an information matching method of advertisements for using the tag database to reflect the main idea of the Web page and tastes of users in real-time. | 2012-10-11 |
20120259860 | LOCK-FREE INDEXING OF DOCUMENTS - Methods and systems for serving documents are provided. Documents may be served to users, for example, in response to search query inputs. Documents may be individually received for serving to users. In order to serve documents, documents are typically indexed. To serve documents in a real-time environment, a data structure is configured to index documents that are received while simultaneously being queried for documents to serve to a user. Documents that have not yet completed the indexing process are not available for serving and, thus, are not queried. Additionally, the data structure includes a memory optimizer such that indexing does not waste memory of the data structure. | 2012-10-11 |
20120259861 | METHOD AND APPARATUS FOR STORING AND SEARCHING FOR INDEX INFORMATION - The present invention discloses a method for storing index information. The method includes: after storing a content, sending index information pointing to the stored content to index nodes in an aggregation network that belong to the same geographical area as the stored content for storing; and sending the index information pointing to the stored content to index nodes in a core network for storing. The present invention also discloses a method for searching for index information, an apparatus for storing index information, an apparatus for searching for index information, and a communication network system. | 2012-10-11 |
20120259862 | Method and apparatus for processing A query - Provided are a method and apparatus for processing a query. The method includes generating string sets comprising a plurality of partial strings from a query string, determining a subset of the string sets as a candidate set, and searching for a document comprising the query string from the candidate set. | 2012-10-11 |
20120259863 | Low Level Object Version Tracking Using Non-Volatile Memory Write Generations - Data versioning in a non-volatile memory. An object key associated with a data object is created. An index into an object table is generated using the object key. A version number is stored in conjunction with the data object stored in the non-volatile memory. In an object linked-list, the object key and the location information of the data object in the non-volatile memory are stored. A record associated with the data object is created in an object table. The record includes an index, a reference to the object linked-list, and the version number. The index is generated based on the object key. | 2012-10-11 |
20120259864 | OPTIMIZATION OF WORK SITE UTILIZATION - Embodiments of the invention provide for optimizing work site utilization within a business entity or the like. Work site optimization is realized by ranking a predetermined group of leased work sites relative to their feasibility for exiting and making decisioning based on the rankings. The ranking is based on an automated and qualitative scoring of the work sites. Additionally, embodiments of the invention account for the potential use of off-work site employees and, as such, the optimization rankings that are provided serve to predict future work site needs. | 2012-10-11 |
20120259865 | AUTOMATED CORRELATION DISCOVERY FOR SEMI-STRUCTURED PROCESSES - A computer-implemented method, system, and article of manufacture for determining a set of correlated data among heterogeneous computer applications. The method includes providing a computer system having software modules, receiving statistics on data relating to a first event and a second event, generating a confidence score for an attribute set, where the attribute set includes an attribute from the first event data and an attribute from the second event data, and selecting the attribute set as a set of correlated data if the confidence score is within a threshold value. | 2012-10-11 |
20120259866 | SYSTEM AND METHOD FOR AUTOMATICALLY EVALUATING CONTRIBUTOR PERFORMANCE - A computer system automatically evaluates the performance of a content generator using content created by the content generator and user and content generator interactions with the content. Specifically, the system analyzes data regarding the content, e.g., a peer-review quality score, and analyzes data regarding user and/or content generator interactions with the content, e.g., website comments regarding the content. In addition, the system considers user and content generator interactions with the content on third-party websites, e.g., the number of Facebook® “likes” or other social media actions. The system applies rules to assign values to various data points (e.g., a value of 0.3 may be assigned for each Facebook® “like” by a user). The rules may also define weighing components to incentivize particular actions. Weighed values are summed to evaluate each content generator. The scores for each content generator may be compared to create a content generator ranking. | 2012-10-11 |
20120259867 | DATA CLASSIFICATION TOOL USING DYNAMIC ALLOCATION OF ATTRIBUTE WEIGHTS - An analysis tool for causing a computer to use information gain of attributes and a classification algorithm to classify new records in a set of data by taking into account the predictive value of the attributes and the effect of the new record. | 2012-10-11 |
20120259868 | ACCESSIBLE COMMANDING INTERFACE - A commanding interface can provide an efficient computer interface for users of assistive technology by focusing on the tasks that an application can perform, rather than on the interface the application exposes. The commanding interface can provide a search mechanism that searches for and presents functions or functionality in response and dynamically updates results as the search query is entered. Additionally, the commanding interface can prioritize search results based on contextual data, including prior search terms, prior actions, and the context of the user's interaction with the application program. The commanding interface can enable the user to filter the functions and functionality presented through the commanding interface according to types of user-performed activities for which such functions would be utilized, patterns, or heuristically determined associations. | 2012-10-11 |
20120259869 | SYSTEM AND METHOD FOR IMPLEMENTING A WINDOW SORTING MECHANISM - A system and method of providing a window sorting mechanism comprises receiving an array having a plurality of objects, wherein each object contains a digit. The digits in the received array are unsorted in association with a desired sorting arrangement. A length of the received array is determined, whereby received array is separated into a plurality of sub-arrays based on the length of the received array. An inter sub-array digit sorting process is performed in a first iteration between a first sub-array and a second sub-array to sort digits in correspondingly positioned objects in accordance with a first comparison rule. A first adjacent-object digit sorting process is performed in a second iteration on the first and second sub-arrays using simultaneously sorting windows of a first digit size in accordance with a second comparison rule. A second adjacent-object digit sorting process is then performed in a third iteration on the first and second sub-arrays using sorting windows of a second digit size. | 2012-10-11 |
20120259870 | METHOD AND SYSTEM FOR ESTABLISHING SORTING ORDER FOR EVENTS - Embodiments of the disclosure relate to a method and system for establishing sorting order for events from a plurality of systems. Central Unique Identity Service (CUIS) provides a unique ID to a client for an event. The client is a service provider registered with the CUIS. User is a subscriber of the client. The User initiates an event with the client using his computing or communication device. The client requests for a unique ID for the initiated event with the CUIS through a network, before the event is performed or executed. The CUIS records the unique ID along with predefined attributes of the client application, the application identifier for the event, application network identity, application user and the user's device associated with the event in the CUIS unit. The CUIS thus establishes a sorting order for the unique ID's recorded and thereby for the events across all clients. | 2012-10-11 |
20120259871 | Illustrating Cross Channel Conversion Paths - Methods, systems, and apparatuses, including computer programs encoded on computer readable media, for generating Venn-like diagram illustrating cross channel conversion paths. In one aspect, a plurality of conversion paths are received. Each conversion path includes one or more user interactions that include a plurality of dimensional data. A sorted list of channel groups that includes one or more group rules is received and each user interaction is grouped into a channel based upon the channel groups. A selection of channels to visualize is received and an image including one circle for each selected channel is generated. The circles are optimally placed to maximize the accuracy of the overlapped regions with channel group data. | 2012-10-11 |
20120259872 | Automatically Generating Data Transformations for Business Process Platforms - Business process providers implement client data processing processes for clients. The business process providers use certain formats (provider formats, defined by provider format fields). The clients use certain formats (client formats, defined by client format fields). A normative format is automatically defined and used as an intermediary between client and provider formats. Mappings between the normative format and the client and provider formats can be generated automatically. | 2012-10-11 |
20120259873 | CONTENT TRANSFER - The present invention provides a method of transferring content from a file and a database. In this case, the file includes content instances, each content instance being associated with a respective field, and each field having a respective type. The transfer is achieved by determining the type of each field, and then storing each content instance in a store in accordance with the determined field type of the associated field. Each content instance can then be transferred to the database in accordance with the determined field type. A similar procedure is provided for creating XML files based on content within the database. | 2012-10-11 |
20120259874 | CONTENT TRANSFER - The present invention provides a method of transferring content from a file and a database. In this case, the file includes content instances, each content instance being associated with a respective field, and each field having a respective type. The transfer is achieved by determining the type of each field, and then storing each content instance in a store in accordance with the determined field type of the associated field. Each content instance can then be transferred to the database in accordance with the determined field type. A similar procedure is provided for creating XML files based on content within the database. | 2012-10-11 |
20120259875 | KEY-BREAK AND RECORD-LOOP PROCESSING IN PARALLEL DATA TRANSFORMATION - Embodiments of the invention provide a method and apparatus for providing additional functionality to a data processing program. This is achieved by various means, including preprocessing records in a data volume, designating certain records with a key-break, and creating an aggregation structure that user programs may use to store previously-processed records from the data volume. | 2012-10-11 |
20120259876 | Database for Managing Contracts were Multiple Existing or Expiring Contracts are Replaced with a Combined Contract - Methods and systems for managing media distribution are disclosed. Advantageously, the management of media distribution can be substantially computer implemented and include management of media distribution agreements. The management of media distribution agreements can operate to manage the replacement of media distribution agreements in an automated and efficient manner. The methods and systems for management of media distribution can take appropriate action when one or more prior existing media distribution agreements are to be replaced with a replacement media distribution agreement for any of a variety of reasons. | 2012-10-11 |
20120259877 | METHODS AND SYSTEMS FOR RUNTIME DATA ANONYMIZATION - Systems, methods, and computer-readable media for anonymizing data include: intercepting a communication; identifying sensitive data in the communication; transmitting the sensitive data to an anonymization engine; receiving masked data from the anonymization engine; and transmitting the masked data. | 2012-10-11 |
20120259878 | STRUCTURED TEXT SEARCH-EXPRESSION-GENERATING DEVICE, METHOD AND PROCESS THEREFOR, STRUCTURED TEXT SEARCH DEVICE, AND METHOD AND PROCESS THEREFOR - Provided is a structured document search formula generating device capable of generating a search formula, which searches for a target element by automatically specifying an element acting as a guideline as a search condition when the element acting as the guideline is not structurally present on a structural related position but the element acting as the guideline is present on a display screen. The structured document search formula generating device is provided with a sample text accumulating unit, which accumulates a plurality of sample texts each composed of a structured document being a search target for each document type, an element specifying unit, which specifies a search target element in each of a plurality of sample texts, a structure analyzing unit, which analyzes a structure of a specified sample text and generates a search formula indicating a structural position of the specified search target element in a structure of the sample text, a screen analyzing unit, which analyzes a display image of the specified sample text and determines the element present on a common relative position on the display image of each of a plurality of sample texts as a guideline element on a screen, and a search formula combining unit, which generates one obtained by adding the determined guideline element on the screen as a condition to the search formula indicating the generated structural position. | 2012-10-11 |
20120259879 | CONTENT PROCESSING APPARATUS, METHOD, AND SYSTEM - A content processing apparatus managed as a content-using apparatus in apparatus information associating a content-using apparatus that supports content data with functions available in using the content data, and having a content processing unit that processes content data in response to a user's operation so that the user can utilize the content data, a used function identification unit that identifies a function used to process the content data and generates used function information indicating the identified function, and an apparatus search result display unit to display information of a content-using apparatus extracted by searching through apparatus information based on the used function information. | 2012-10-11 |
20120259880 | IMAGE PROCESSING APPARATUS AND METHOD FOR CONTROLLING IMAGE PROCESSING APPARATUS - An apparatus includes a designation unit, a search unit, and an output unit. The designation unit designates a page number and a search key as a search condition. The search unit automatically searches paginated documents stored in a storage containing the designated search key within the designated page number. The output unit outputs an image of the designated page number of the searched document as a search result. | 2012-10-11 |
20120259881 | PEER TO PEER (P2P) MISSING FIELDS AND FIELD VALUATION FEEDBACK - Methods, systems, and apparatus for processing data, and more specifically to retrieving results for a query from one or more devices coupled to a network. A first device may receive an abstract query including logical fields defined by a first data abstraction model and retrieve query results stored in the first device. The query may be sent to one or more other devices via the network. The one or more other devices may be configured to convert the abstract query to local abstract queries including logical fields defined in local data abstraction models. The local queries may be issued against local databases to retrieve additional results for the query. The local queries may not include all the fields of the abstract query. | 2012-10-11 |
20120259882 | Mining for Product Classification Structures for Intenet-Based Product Searching - A product search engine uses web-crawling software to index textual webpage content from multiple internet sources. The product data obtained from the web-crawling process is then granulized by parsing methods into key words, such as, words and/or phrases. These components are compared with existing key words from search queries or webpage content. Each key word includes component tags, where the component tags map each component to product classification information in the form of structural parameters; and other product information such as, URLs, product images and product descriptions. When at least one matching key word is found, structural parameters are extracted from the matching components and assigned to the received key words. A search results webpage including product information grouped by associated structural parameter may be provided. | 2012-10-11 |
20120259883 | SYSTEM AND METHOD FOR SELECTING USER EXPERIENCE DESIGN RESOURCES - A system and method is provided for retrieving disparate design data in connection with the design of a device, a service, or a system. A user design application enables users to store disparate data according to predefined links in a central data source. The user design application also enables users to query the central data source to retrieve relevant disparate design data based on the predefined relationships. | 2012-10-11 |
20120259884 | SYSTEM AND METHOD FOR IDENTIFYING A COMPONENT FOR A TIRE PRESSURE MONITORING SYSTEM - A system and method for identifying a component, such as a sensor, for a Tire Pressure Monitoring System (TPMS) to be replaced for a vehicle of interest by performing a Quick Search or an Advanced Search of a TPMS Manager database. In the Quick Search, the user inputs year/make/model (Y/M/M) or Vehicle Identification Number (VIN). In the Advanced Search, the user inputs various physical attributes of the component to be replaced. All related superseded, alias or interchange parts with like communication or physical structure and relevant service components are determined and the results displayed to the user. A relearn procedure for the replacement TPMS component for the vehicle of interest identifies and validates scan tool compatibility. A report to the user of a cause/failure analysis of the component to be replaced can be displayed. | 2012-10-11 |
20120259885 | META-DATA APPROACH TO QUERYING MULTIPLE BIOMEDICAL ONTOLOGIES - A method for retrieving information spread across a plurality of different ontologies, including: defining a meta-ontology, wherein the meta-ontology includes high-level properties and their mappings to specific properties defined in a plurality of different ontologies; receiving a question, wherein the question is associated with a high-level property; and providing an answer to the question, wherein the answer is determined by using the meta-ontology. | 2012-10-11 |
20120259886 | SYSTEM AND METHOD FOR THE AUTOMATIC GENERATION OF A QUERY TO A DICOM SERVER - A system and method for automatically generating a query to a DICOM server computer. The system comprises patient identification information encoded in a tangible medium. The system further comprises a reading device to read the encoded patient identification information from the tangible medium. The system also includes a computer-based platform hosting a medical software application. The computer-based platform operationally interfaces to the reading device to receive the read patient identification information from the reading device and to automatically generate a DICOM query, using the medical software application, such that the DICOM query includes at least a portion of the patient identification information. The system further comprises at least one DICOM server computer operationally interfacing to the computer-based platform to receive the DICOM query from the computer-based platform. | 2012-10-11 |
20120259887 | METHOD AND A SOFTWARE APPLICATION FOR THE SELECTION OF AN ANIMAL WITH DESIRABLE CHARACTERISTICS - A method for selecting an animal with desirable characteristics, including the steps of: receiving information regarding the parentage of the animal; arranging the parentage information into an appropriate structure; and utilizing an algorithm to identify a suitable animal based on the parentage of the animal. An apparatus and a program for practicing the method are also disclosed. | 2012-10-11 |
20120259888 | EFFICIENT STORAGE AND SEARCH OF WORD LISTS AND OTHER TEXT - A computer readable storage medium tangibly embodying machine-readable digital data arranged to facilitate expedited searching. The data includes a plurality of words residing in a table having rows and columns, each word residing in a different row and each letter of the word occupying a different column in that row. Each continuous run of same letters in a column forms an interval. The words are positioned relative to each other to maximize lengths of the intervals, and/or optimize efficiency of compression of the columns by run length encoding. | 2012-10-11 |
20120259889 | Scalable Database Management Software on a Cluster of Nodes Using a Shared-Distributed Flash Memory - A distributed database system has multiple compute nodes each running an instance of a database management system (DBMS) program that accesses database records in a local buffer cache. Records are persistently stored in distributed flash memory on multiple storage nodes. A Sharing Data Fabric (SDF) is a middleware layer between the DBMS programs and the storage nodes and has API functions called by the DBMS programs when a requested record is not present in the local buffer cache. The SDF fetches the requested record from flash memory and loads a copy into the local buffer cache. The SDF has threads on a home storage node that locate database records using a node map. A global cache directory locks and pins records to local buffer caches for updating by a node's DBMS program. DBMS operations are grouped into transactions that are committed or aborted together as a unit. | 2012-10-11 |
20120259890 | KNOWLEDGE-BASED DATA MINING SYSTEM - In a data mining system, data is gathered into a data store using, e.g., a Web crawler. The data is classified into entities. Data miners use rules to process the entities and append respective keys to the entities representing characteristics of the entities as derived from rules embodied in the miners. With these keys, characteristics of entities as defined by disparate expert authors of the data miners are identified for use in responding to complex data requests from customers. | 2012-10-11 |
20120259891 | METHOD, SYSTEM AND PROGRAM FOR ANALYTICS DATA DELIVERING - Provided are computer-implemented methods and computer systems for interactive data delivery to a user and for setting up a user profile. An interactive data delivery method involves retrieving generic data, which may be web analytics or some other forms of data, and processing this retrieved data based on various user specific rules. As such, the processed data provided to the user is more focused and has elements of business intelligence needed by a particular user. User requirements may depend on industry, business objectives, website objectives, the user's role in the organization, and other factors. Data may be requested and provided in an interactive form that includes voice recognition and voice output features. | 2012-10-11 |
20120259892 | SECURELY EXTENDING ANALYTICS WITHIN A DATA WAREHOUSE ENVIRONMENT - A vendor is authenticated for use of a retailer's data warehouse and limited access rights are assigned to the vendor for access. The vendor accesses a graphical user interface (GUI) to select an available analysis module for execution against the data warehouse. Schemas are presented in the GUI based on the access rights, and specific schema selections are made by the vendor. The analysis module is then configured and executed against the data warehouse and filtered results are presented to the vendor; the results filtered based on the access rights assigned to the vendor. | 2012-10-11 |
20120259893 | Software and Metadata Structures for Distributed And Interactive Database Architecture For Parallel And Asynchronous Data Processing Of Complex Data And For Real-Time Query Processing - The various embodiments of the invention provide software and metadata structures for a data processing system and method, for applications such as marketing campaign management, speech recognition and signal processing. An exemplary system embodiment includes a first data repository adapted to store a plurality of entity and attribute data; a second data repository adapted to store a plurality of entity linkage data; a metadata data repository adapted to store a plurality of metadata modules, with a first metadata module having a plurality of selectable parameters, received through a control interface, and having a plurality of metadata linkages to a first subset of metadata modules; and a multidimensional data structure. | 2012-10-11 |
20120259894 | MULTI-MASTER DATA REPLICATION IN A DISTRIBUTED MULTI-TENANT SYSTEM - A multi-master replication system is disclosed. The multi-master replication system allows a large set of peer instances to collaboratively replicate data to each other. | 2012-10-11 |
20120259895 | Converting Video Metadata to Propositional Graphs for Use in an Analogical Reasoning System - An automatic approach is described for the semantic analysis and conversion of video annotation metadata (e.g., Video Event Markup Language or “VEML” metadata) to propositional graphs suitable for analysis by an analogical reasoning system (ARS). Also as described herein, a system architecture implements this conversion while maintaining semantic consistency from annotation through results reporting. Further, the techniques herein leverage the same ontology to populate options for an annotation tool, provide the rules for the metadata-to-propositional graph mapping, and provide the basis for comparison in an analogical reasoning algorithm. | 2012-10-11 |
20120259896 | System and Method of Optimizing Performance of Schema Matching - In one embodiment the present invention includes a computer-implemented method of improving performance of schema matching. The method includes storing a matching topology that maps a first data structure to a second data structure. The method further includes identifying a first portion of the matching topology that is a candidate for improvement as determined according to an incidence graph. The method further includes rewriting the first portion of the matching topology with a second portion according to the incidence graph. | 2012-10-11 |
20120259897 | DETERMINATION OF LANDMARKS - Hash values corresponding to a file are processed in windows to determine a minimum hash value for each window. Each window may begin at a minimum hash value determined for a previous window and end after a fixed number of hash values. If a hash value is less than a threshold hash value, it is added to a buffer that is used to store the hash values in sorted order for a current window. If a hash value is greater than the threshold, it is added to another buffer whose hash values are not stored in sorted order. At the end of the current window, the minimum hash value in the first buffer is selected as the landmark for the window. If the first buffer is empty, then the hash values in the other buffer are sorted and the minimum hash value is selected as the landmark for the window. | 2012-10-11 |
20120259898 | Automatically Optimizing Business Process Platforms - Business process provider(s) process client data. The clients use certain formats (client formats, defined by client format fields). The client format fields instantiated in documents are analyzed. Based on this analysis, the client processes are automatically grouped into different process platforms for processing. For example, similar client processes preferably are grouped together into the same process platform, in order to increase efficiency of processing. In another aspect, the user interfaces used by the business process provider(s) may be constructed from different blocks, where the blocks are automatically defined based on the analysis of client format fields. | 2012-10-11 |
20120259899 | CONTENT TRANSFER - The present invention provides a method of transferring content from a file and a database. In this case, the file includes content instances, each content instance being associated with a respective field, and each field having a respective type. The transfer is achieved by determining the type of each field, and then storing each content instance in a store in accordance with the determined field type of the associated field. Each content instance can then be transferred to the database in accordance with the determined field type. A similar procedure is provided for creating XML files based on content within the database. | 2012-10-11 |
20120259900 | Virtual Disk Utility - In particular embodiments, a method comprising, by one or more computing devices, installing an application on a portion of a physical disk system of a first platform, virtualizing the portion of the physical disk system into a virtual disk system, comprising, storing data in the portion of the physical disk system in a database of the virtual disk system, providing an interface to access the data stored in the database, and providing a plurality sets of drivers for a plurality of platforms, wherein each set of drivers supports native operations with respect to the portion of the physical disk system on a different one of the plurality of platforms, mounting the virtual disk system on a second platform, and executing the application on the second platform, wherein all operations in connection with executing the application are contained within the virtual disk system mounted on the second platform. | 2012-10-11 |