02nd week of 2013 patent applcation highlights part 57 |
Patent application number | Title | Published |
20130013546 | PROVIDING COMMUNITY FOR CUSTOMER QUESTIONS - A system for providing community for customer questions receives a customer question. The customer question may be classified into a classification from a plurality of classifications categorizing whether a question is answerable, needs expert assistance, needs more information, or is not answerable. Based on the classification and one or more incentives, the question may be further routed to an appropriate community. The interactions with a customer in receiving and answering the customer question may be recorded. | 2013-01-10 |
20130013547 | EVIDENCE PROFILING - Evidence profiling, in one aspect, may receive a candidate answer and supporting pieces of evidence. An evidence profile may be generated, the evidence profile communicating a degree to which the evidence supports the candidate answer as being correct. The evidence profile may provide dimensions of evidence, and each dimension may support or refute the candidate answer as being correct. | 2013-01-10 |
20130013548 | SYSTEM AND METHOD FOR PROVIDING CONFIGURABLE SECURITY MONITORING UTILIZING AN INTEGRATED INFORMATION SYSTEM - A system and method for implementing an integrated information system are provided. A premises server is in communication with a variety of information sources that produce monitoring data for a premises. The premises server collects, presents, and transmits the monitoring device data to a central server capable of processing data from multiple premises servers. The central server receives the data and traverses one or more logical rule sets to determine whether the inputted data violates the rules. Based on an evaluation of the rules, the central server generates outputs in the form of communication to one or more authorized users via a variety of communication mediums and devices and/or the instigation of a variety of acts corresponding to the evaluation of the rules. | 2013-01-10 |
20130013549 | HARDWARE-ASSISTED APPROACH FOR LOCAL TRIANGLE COUNTING IN GRAPHS - A method and apparatus are provided for hardware-assisted local triangle counting in a graph. The method includes converting vertex relationships of the graph into rule patterns. The method also includes compiling the rule patterns into a binary file, wherein the rule patterns are organized into a finite state machine. The method further includes loading at least a part of the binary file and a search string to be compared there against into a hardware pattern matching accelerator. The method additionally includes receiving a number of matching outputs from the pattern matching accelerator. | 2013-01-10 |
20130013550 | Inception of Live Events - Common interests of at least two different groups of users are captured and analyzed to create a proposal for an event that would satisfy the interests of each group of users. One group of users may be consumers of content, another group of users may be providers of content and a further group of users may, for example, be venue providers. Once an event is proposed, ownership of the event may be prompted for. | 2013-01-10 |
20130013551 | PROCESS ANALYSIS - An apparatus and method are disclosed for analysing a process. An exemplary method includes: generating a process template; and determining a probabilistic model specifying the process template. The method can include use of task nodes for tasks of the process; observables nodes for observables that may be caused by performance of the tasks; and a background activities node, wherein observables may further be caused by background activities of the background node. The method can include use of task nodes for tasks of the process; observables nodes for observables that may be caused by performance of the tasks; and a background activities node, observables may further be caused by background activities of the background node. The method can include measuring values of an observable corresponding to one of the observables nodes; and updating a probabilistic estimate of the process state using the measured values. | 2013-01-10 |
20130013552 | Interest-Driven Business Intelligence Systems and Methods of Data Analysis Using Interest-Driven Data Pipelines - Interest-driven Business Intelligence (BI) systems in accordance with embodiments of the invention are illustrated. In one embodiment of the invention, a data processing system includes raw data storage containing raw data, metadata storage containing metadata that describes the raw data, and an interest-driven data pipeline that is automatically compiled to generate reporting data using the raw data, wherein the interest-driven data pipeline is compiled based upon reporting data requirements automatically derived from at least one report specification defined using the metadata. | 2013-01-10 |
20130013553 | Automated Entity Verification - Some embodiments provide a verification system for automated verification of entities. The verification system automatedly verifies entities using a two part verification campaign. One part verifies that the entity is the true owner of the entity account to be verified. This verification step involves (1) the entity receiving a verification code at the entity account and returning the verification code to the verification system, (2) the entity associating an account that it has registered at a service provider to an account that the verification system has registered at the service provider, (3) both. Another part verifies the entity can respond to communications that are sent to methods of contact that have been previously verified as belonging to the entity. The verification system submits a first communication with a code using a verified method of contact. The verification system then monitors for a second communication to be returned with the code. | 2013-01-10 |
20130013554 | COMPENSATING FOR UNBALANCED HIERARCHIES WHEN GENERATING OLAP QUERIES FROM REPORT SPECIFICATIONS - Systems, methods and articles of manufacture are disclosed for generating an online analytical processing (OLAP) query against a cube. The cube may have dimensions, each dimension having a hierarchy of members. A report specification may be received against a hierarchy of the cube. An OLAP query may be generated from the report specification. The OLAP query may include projected members not having any descendant at the detail level of the hierarchy, thus producing more accurate results. | 2013-01-10 |
20130013555 | Machine to Machine (M2M) Application Server, XDMS server, and Methods for M2M Applications Group Management - Methods and corresponding Machine-to-Machine Application Server (M2M-AS) and XML Data Management Server (XDMS) are provided for managing groups of M2M applications running on various devices. As groups of M2M applications are formed in a network, the group information comprising identities of the groups and identities of M2M applications belonging to each group is relayed to the M2M-AS. The later further sends such information to the XDMS server for storage. Requests for group membership related to M2M applications can then be handled. When a request for group membership related to an application is received at an M2M gateway or at the M2M-AS, the request is further sent to the XMDS server, which replies back to the requestor with identities of the group(s) that comprise the given M2M application, thus enabling, for example, the requestor to communicate not only with the application, but with entire groups comprising the application. | 2013-01-10 |
20130013556 | METHOD OF MANAGING DATABASE - A multi-master node model database management technology involves notifying a higher-level master node of a transaction minimum value as a minimum value of an implementation-underway transaction in a snapshot from a lower-level master node, comparing the transaction minimum value with minimum values retained by the respective master nodes and thus updating a node minimum value and a cluster minimum value. Then, the lower-level master node transmits a write set containing a shadow copy of its own database, a heap tuple map deployed on its own memory and the transaction minimum value to the higher-level master node, and the higher-level master node receiving the write set updates the database by use of the write set if the transaction minimum value is equal to or larger than the cluster minimum value, and aborts the write set if the transaction minimum value is smaller than the cluster minimum value. | 2013-01-10 |
20130013557 | METHOD OF UPDATING A DATABASE OF A NAVIGATION DEVICE AND NAVIGATION DEVICE - To update a database of a navigation device which stores at least a base version of a digital map, versions of the digital map which are available locally in the database or remotely from the navigation device are identified. To execute the navigation task, a version of the digital map is selected for execution of the navigation task. Data from a sub-set of storage blocks in which the selected version is stored is required to execute the navigation task. Depending on whether all storage blocks of the sub-set are already stored locally in the database, data stored in storage blocks of the sub-set which are not yet stored locally in the database are downloaded via a wireless interface. The downloaded data are stored in the database without modifying the base version of the digital map. | 2013-01-10 |
20130013558 | SEMANTIC CHECKS FOR SYNCHRONIZATION: IMPOSING ORDINALITY CONSTRAINTS FOR RELATIONSHIPS VIA LEARNED ORDINALITY - A method and apparatus for semantic checking for synchronization. In one embodiment, a process is provided to define a relationship model for each data type in a first set of data and may store each relationship model. For each entry in a second set of data to be synchronized with the first set of data, the process determines if the entry violates the relationship model for the data type corresponding to the entry. | 2013-01-10 |
20130013559 | Bookmarked Synchronization of Files - A file synchronization system that includes a non-volatile memory for storing at least one bookmark respective to a file; a telecommunication mechanism for receiving a new bookmark value respective to this file; and a controller operative to update the respective bookmark according to the new bookmark value; and to control presentation of the file in accordance with the updated bookmark value. A plurality of bookmarks that associate to a single file are stored in the file synchronization system, each such bookmark respective to a different user. | 2013-01-10 |
20130013560 | DESKTOP APPLICATION FOR ACCESS AND INTERACTION WITH WORKSPACES IN A CLOUD-BASED CONTENT MANAGEMENT SYSTEM AND SYNCHRONIZATION MECHANISMS THEREOF - Systems and methods for synchronizing workspaces in a web-based collaboration environment with local folders on computers of collaborators of the workspaces are disclosed. Collaborators of a workspace can edit copies of work items either at the collaboration environment server or at the computer. Updates to all synchronized folders are automatically performed. Conflicts between edits made by different collaborators to the same file are flagged, and a notification is sent to the author attempting to make edits to a version of a file that has already been updated by another collaborator. | 2013-01-10 |
20130013561 | EFFICIENT METADATA STORAGE - One or more techniques and/or systems are disclosed for efficiently storing metadata of partitioned data (e.g., directed to a specific individual/user). A first subset of data is identified from the set of partitioned data. The first subset of data comprises data that has a high frequency of access, and may be identified, at least in part, by frequency of access metadata that is associated with the data in the set. Metadata, such as discovery information, permissions, version info, etc., that is associated with the data in the first subset can be stored in low latency (e.g., fast) storage, proving more efficient access. Metadata associated with data from the set of partitioned data that is not in the first subset (e.g., that is not accessed frequently) can be stored in higher latency (e.g., slower, less expensive) storage. | 2013-01-10 |
20130013562 | MULTI-NODE REPLICATION SYSTEMS, DEVICES AND METHODS - Replication techniques are presented. According to an embodiment of a method, a node of a replicated storage network is assigned to be an owner of a data block to issue write memory block commands. The network includes at least two nodes including the node assigned to be the owner. If a read memory block command is received to read the data block, a read_lock is issued for the data block, the data block is read, and the read_lock for the data block is released. If a write memory block command is received to write new data to the data block, a write_lock is issued for the data block, the data block is written and a version associated with the data block is incremented, and the write_lock for the data block is released. | 2013-01-10 |
20130013563 | SYSTEM AND METHOD FOR PERFORMING INTEGRATED STORAGE OPERATIONS - The present invention relates to a method for performing integrated storage operations on an information store. The present invention comprises identifying a plurality disparate types of storage operations stored in a policy option table. A first storage operation is performed according to a first set of storage criteria stored in the policy option table and a second operation, disparate from the first storage operation, is performed according to a second set of storage criteria stored in the policy option table. | 2013-01-10 |
20130013564 | METHODS AND APPARATUS FOR TIME-BASED DYNAMICALLY ADJUSTED JOURNALING - A data center for data backup and replication, including a pool of multiple storage units for storing a journal of I/O write commands issued at respective times, wherein the journal spans a history window of a pre-specified time length, and a journal manager for dynamically allocating more storage units for storing the journal as the journal size increases, and for dynamically releasing storage units as the journal size decreases. | 2013-01-10 |
20130013565 | TECHNIQUES FOR ESTABLISHING A FILE SYSTEM THAT EXPOSES A VIRTUAL FILE SYSTEM FOR BACKUP OPERATIONS - Techniques for establishing a files system that exposes a virtual file system for backup operations are presented. Changes to files of a file system are maintained separately or collected and presented as a VFS. The VFS is then used to perform backup operations. Moreover, the files identified in the VFS can be customized based on search parameters, criterion, and/or criteria supplied by a user or supplied as parameters to backup and VFS mount operations. | 2013-01-10 |
20130013566 | STORAGE GROUP SYNCHRONIZATION IN DATA REPLICATION ENVIRONMENTS - A method for dynamically synchronizing storage groups in a data replication environment is disclosed. In one embodiment, such a method includes detecting the addition of a volume to a storage group of a primary storage system. The method then automatically performs the following in response to detecting the addition of the volume: (1) adds a corresponding volume to a corresponding storage group on a secondary storage system; (2) creates a mirroring relationship between the volume added to the primary storage system and the volume added to the secondary storage system; and (3) adds the mirroring relationship to a mirroring session established between the storage groups on the primary and secondary storage systems. A corresponding system and computer program product are also disclosed. | 2013-01-10 |
20130013567 | ARCHIVING DE-DUPLICATED DATA ON TAPE STORAGE MEDIA USING GRAPH PARTITIONS - Embodiments of the invention relate to data archiving on storage medium such as magnetic tapes based on graph partitioning. One aspect of the invention concerns a method that comprises representing a file system as a graph where each node of the graph represents a file and each edge represents file chunks common to the files corresponding to the nodes connected by the edge. The graph is repeatedly partitioned into disjoint sub-graphs. If the files and duplicate file chunks associated with a sub-graph fit into a data storage medium, then the files and duplicate file chunks are stored in the medium. Otherwise, the method may partition the sub-graph into smaller disjoint sub-graphs taking into consideration of degrees of connectivity of the nodes. | 2013-01-10 |
20130013568 | System and Method for Data Storage - In one embodiment, a method includes storing a first data table entry applying a schema used at a first point in time along with pointer data and pattern space information collectively representing the first data table entry at the first point in time and generating, at a later point in time, a map responsive to a schema change. The map comprises new pointer data or new pattern space information. | 2013-01-10 |
20130013569 | Efficient Backup and Restore of Virtual Input/Output Server (VIOS) Cluster - A method enables cluster-level backup and restore functionality of all Virtual Input/Output Server (VIOS) configuration data within a VIOS cluster and the data of a shared VIOS cluster database. The method comprises: performing, via a backup/restore utility of a VIOS partition, a cluster level backup, which creates a first VIOS cluster configuration backup file having configuration information about hardware, logical and virtual devices of each VIOS partition within a VIOS cluster and all cluster data from the shared VIOS database of the VIOS cluster; storing the VIOS cluster configuration backup file within a storage location; and responsive to receipt of a VIOS restore command at a VIOS partition: retrieving the configuration backup file from the storage location; restoring a configuration of the hardware, logical and virtual devices of each VIOS within the VIOS cluster to prior state; and restoring the shared VIOS database with the backed-up cluster data. | 2013-01-10 |
20130013570 | FILE STORAGE APPARATUS, DATA STORING METHOD, AND DATA STORING PROGRAM - An extraction unit extracts, in accordance with a format of a file which the client apparatus requests a file storage apparatus to store to storing means, data possibly made into independent data as an independent file from the file which is data in a portion that can be stored to the storing means. A duplicate determination unit determines whether the storing means stores data matching the data possibly made into independent data that is extracted by the extraction unit or remaining data which are data obtained by deleting the data possibly made into independent data from the file. A storing processing unit stores, to the storing means, the data possibly made into independent data or the remaining data which do not match data stored to the storing means, on the basis of the determination result made by the duplicate determination unit. A restoring unit restores a file by connecting the remaining data and the data possibly made into independent data which are stored to the storing means by the storing processing unit, in accordance with a request made by the client apparatus. | 2013-01-10 |
20130013571 | MANAGEMENT OF OBJECT MAPPING INFORMATION CORRESPONDING TO A DISTRIBUTED STORAGE SYSTEM - Systems and methods for managing mapping information for objects maintained in a distributed storage system are provided. The distributed storage system can include a keymap subsystem that manages the mapping information according to object keys. Requests for specific object mapping information are directed to specific keymap coordinators within the keymap subsystem. Each keymap coordinator can maintain a cache for caching mapping information maintained at various information sources. To manage the cache, the keymap system can utilize information placeholders that replace previously cached keymap information while a request to modify keymap information is being processed by the information sources. Each keymap coordinator can process subsequently received keymap information read requests in the event an information placeholder is cached as the current cached keymap information. | 2013-01-10 |
20130013572 | OPTIMIZATION OF A COMPUTING ENVIRONMENT IN WHICH DATA MANAGEMENT OPERATIONS ARE PERFORMED - Described are embodiments of an invention for optimizing a computing environment that performs data management operations such as encryption, deduplication and compression. The computing environment includes data components and a management system. The data components operate on data during the lifecycle of the data. The management system identifies all the data components in a data path, how the data components are interconnected, the data management operations performed at each data component, and how many data management operations of each type are performed at each data component. Further, the management system builds a data structure to represent the flow of data through the data path and analyzes the data structure in view of policy. After the analysis, the management system provides recommendations to optimize the computing environment through the reconfiguration of the data management operation configuration and reconfigures the data management operation configuration to optimize the computing environment. | 2013-01-10 |
20130013573 | RETRIEVAL AND RECOVERY OF DATA CHUNKS FROM ALTERNATE DATA STORES IN A DEDUPLICATING SYSTEM - For recovery of data chunks from alternate data stores, a method detects a damaged copy of a first data chunk of a deduplicated data object within a first storage pool of plurality of storage pools storing data chunks. The method further locates an undamaged copy of the first data chunk in an alternate storage pool within the plurality of storage pools from a system-wide deduplication index that indexes each data chunk in each storage pool. In addition, the method creating a new object holding the undamaged copy in the first storage pool, the new object linked to the damaged copy through the system-wide deduplication index. | 2013-01-10 |
20130013574 | Block Entropy Encoding for Word Compression - A computer-implemented method, computer-readable media, and a computerized system to compress words are provided. The computerized system includes a compression engine that compresses a list of words. The compression engine generates a symbol list from the list of words, decomposes the words using the symbol list and a cost function, and encodes the decomposed words. The words may be from a search index. The compression engine may be utilized to reduce the size of the search index and improve efficiency. | 2013-01-10 |
20130013575 | Time-Outs with Time-Reversed Linear Probing - A current key is received at a current arrival time at a computer. An index in an array corresponding to the current key is determined using a hash function. A previous key and a previous arrival time are retrieved from the array at the index. The array is transformed by replacing the previous key and the previous arrival time with the current key and the current arrival time in the array at the index. The previous key and the previous arrival time are inserted into a nearest eligible sequential index in the array. | 2013-01-10 |
20130013576 | SYSTEM WITH MULTIPLE CONDITIONAL COMMIT DATABASES - A system for processing a transaction is disclosed. The system comprises a processor and a memory. The processor is configured to check a condition using data in a first database, wherein the data is associated with a transaction, wherein the data in the first database is latched before checking the condition and is unlatched after checking the condition. The processor is further configured to indicate to a second database to check the condition using data in the second database, wherein the data is associated with the transaction. The data in the second database is latched before checking the condition and is unlatched after checking the condition. The memory is coupled to the processor and configured to provide the processor with instructions. | 2013-01-10 |
20130013577 | METHODS AND SYSTEMS FOR BATCH PROCESSING IN AN ON-DEMAND SERVICE ENVIRONMENT - In accordance with embodiments disclosed herein, there are provided mechanisms and methods for batch processing in an on-demand service environment. For example, in one embodiment, mechanisms include receiving a processing request for a multi-tenant database, in which the processing request specifies processing logic and a processing target group within the multi-tenant database. Such an embodiment further includes dividing or chunking the processing target group into a plurality of processing target sub-groups, queuing the processing request with a batch processing queue for the multi-tenant database among a plurality of previously queued processing requests, and releasing each of the plurality of processing target sub-groups for processing in the multi-tenant database via the processing logic at one or more times specified by the batch processing queue. | 2013-01-10 |
20130013578 | OBJECT RETRIEVAL USING VISUAL QUERY CONTEXT - Some implementations provide techniques and arrangements to perform image retrieval. For example, some implementations identify an object of interest and a visual context in a first image. In some implementations, a second image that includes a second object of interest and a second visual context may be compared to the object of interest and the visual content, respectively, to determine whether the second image matches the first image. | 2013-01-10 |
20130013579 | SYSTEMS, COMPUTER-READABLE MEDIA, AND METHODS OF OPERATING A TARGET COMPUTER SYSTEM TO ANSWER A QUERY - A query may be answered when a compound result URL including a target page identifier and the query is received at a target computer system. The target page identifier may be used to identify a target page on the target computer system. A call script may then be automatically executed and cause receipt of a plurality of suggestions based on the query by the target computer system. The suggestions may include a text of the suggestion and a suggestion URL. A placement script may then be automatically executed that, for example, places the text of each suggestion on the target page. The text of each suggestion may have an associated suggestion URL. Selection of the text of the suggestion may cause redirection of the user computer based on the suggestion URL. | 2013-01-10 |
20130013580 | OPTIMIZED ONTOLOGY BASED INTERNET SEARCH SYSTEMS AND METHODS - Methods and apparatus for providing suggested completions to search results are disclosed which employ locating nodes in a stored ontology, wherein nodes consist of classes or instances of information, that correspond to the at least one search term, retrieving neighbors of located nodes in the stored ontology, and generating suggested completions in a format which separates homonymic terms. Methods and apparatus are disclosed for building ontologies and dynamically expanding ontologies. | 2013-01-10 |
20130013581 | SYSTEMS AND METHODS FOR ONLINE CONTENT SEARCHING - A search engine that can be configured to combine information related to a web page (channel) or content file view and/or “click throughs” with revenue information in order to determine relevance of the various matched content listed in the search results, is disclosed. By combining revenue information with page view/click through information, potentially more relevant results can be presented to the user for viewing. | 2013-01-10 |
20130013582 | METHOD AND APPARATUS FOR USING TAG TOPOLOGY - A method and apparatus for using tag topology for enhancing search capabilities, e.g., searching over the web, are disclosed. For example, the present method receives a user query contain a search term from a user. The method then generates a search result containing at least one entity, wherein the at least one entity is found based on a plurality of user provided tags that is associated with the at least one entity. | 2013-01-10 |
20130013583 | ONLINE VIDEO TRACKING AND IDENTIFYING METHOD AND SYSTEM - A method and system of identifying and tracking online videos comprises the steps of searching and discovering targeted video on the Internet, filtering out manageable amount of online videos from large amount of search results of the targeted video, acquiring online video contents through websites, identifying acquired videos by their contents, and generating different tracking reports according to video identification results and other historical records. | 2013-01-10 |
20130013584 | DATABASE CONSISTENT SAMPLE DATA EXTRACTION - Various embodiments of systems and methods for database consistent sample data extraction are described herein. The technique uses production data as input and outputs sample data in the same relational schema while preserving the integrity of joins of the different tables in the schema. For a given relational schema, the master tables are found. Then a subset is created by placing selection criteria in a query defining how to sample the data for these master tables. Following the joins, the dependent tables are added to the query automatically. | 2013-01-10 |
20130013585 | HASH JOIN AND HASH AGGREGATION INTEGRATION SYSTEM - A hash integration system includes a hash join module including build and probe inputs. A hash aggregation module may aggregate on the probe input of the hash join module, and a hash table generation module may generate an integrated hash table including a record with values from the build and aggregated probe inputs. The hash join module may join the build and aggregated probe inputs to form a joined output. | 2013-01-10 |
20130013586 | METHOD AND SYSTEM FOR DATA MINING FOR AUTOMATIC QUERY OPTIMIZATION - A database monitor tracks performance statistics and information about the execution of different SQL statements. A query optimizer benefits from these statistics when generating an access plan. In particular, the query optimizer, upon receiving an SQL statement, searches the records of the database monitor for similar SQL statements that have previously been executed. As part of determining the best access plan for the current SQL statement, the query optimizer considers the information retrieved from the database monitor. In this way, the access plan that is generated can automatically be tuned based on empirical performance evidence. | 2013-01-10 |
20130013587 | INCREMENTAL COMPUTING FOR WEB SEARCH - Architecture that performs incremental computing for web searches by employing methods at least for storing the results of repeat queries on unchanged webpages and for computing results for the repeated queries. The architecture includes one or more algorithms for pre-computing query results on index servers, for only selectively choosing index servers whose result for a query change for a query computation process, and for re-using the unchanged web pages stored in the cache and computing results upon changed index and unchanged index separately. | 2013-01-10 |
20130013588 | Managing Parameters in Filter Expressions - A mechanism is provided for generating a filter expression using tree parameters receives an expression wherein operators of the expression bind multiple data items to a single parameter to form a received expression, generates a default prompt control using received metadata and the received expression and prompts for an input selection using the default prompt control. Responsive to receiving selected values in response to the default prompt control to form received values the computer-implemented process generates a native database query using the received expression with the single parameter and the received values, wherein the single parameter is a tree parameter. | 2013-01-10 |
20130013589 | Customer Relationship Management System - A computer-implemented method for customer relationship management is provided. The method may include receiving an indication from a user at one or more customer relationship management graphical user interfaces. The method may further include identifying one or more accounts associated with the user. The method may also include providing an itinerary or portion of an itinerary to the user for a particular time period via at least one of the one or more customer relationship management graphical user interfaces. The method may additionally include filtering the one or more accounts based upon, at least in part, an input from the user to generate a filtered result set. The method may also include storing at least one of the filtered result set and the itinerary. | 2013-01-10 |
20130013590 | Searching and Displaying Data Objects Residing in Data Management Systems - A data source is accessed to provide information. The data source is accessed by defining a plurality of data objects each associated with data within the data source, where the data objects include search information that facilitates searching of the data objects, and the data objects further include display information that pertains to a format in which data obtained from a search of the data objects is displayed, defining one or more relationships linking at least one data object with at least one other data object so as to establish associated data objects with linking relationships, receiving a query to search for data within the data source, retrieving data within the data source satisfying the query in accordance with the search information, where the retrieved data comprises data from at least two associated data objects, organizing and displaying the retrieved data in accordance with the display information, and displaying one or more links associated with the retrieved data so as to enable navigation between associated data objects. | 2013-01-10 |
20130013591 | IMAGE RE-RANK BASED ON IMAGE ANNOTATIONS - Search queries for images are received from users. An original order of responsive images to the query is determined. Duplicate images and words associated with the duplicate images are identified for each of the responsive images. Common words associated with the duplicate images are identified. The responsive images are annotated with the common words and an annotated order is determined. A re-ranked order is determined based on the original order and the annotated order. Responsive images are presented to the user in the re-ranked order. | 2013-01-10 |
20130013592 | System for Engaging Experts and Organizing Recorded Media - A system for selecting an expert and receiving expert evaluation data comprising: a computer having access to a database comprising subject matter expert data; where said computer is programmed to perform computer-implemented operations comprising:
| 2013-01-10 |
20130013593 | INFORMATION PROCESSING DEVICE, METHOD AND SERVER FOR DETERMINING TYPE OF ELECTRIC APPLIANCE - A device, a method and a server for performing device identification of electric appliances connected to a network are provided. An information processing device, to which electric appliances are communicably connected via a network, receives a packet at least containing a packet for checking the status of a communication port of the electric appliance. | 2013-01-10 |
20130013594 | INFORMATION PROCESSING DEVICE, METHOD AND SERVER FOR DETERMINING TYPE OF ELECTRIC APPLIANCE - A device, a method and a server for performing device identification of electric appliances connected to a network are provided. An information processing device, to which electric appliances are communicably connected via a network, receives a packet (a response packet and/or a passive packet) for determining a type of an electric appliance, from the electric appliances. The information processing device stores definition files defined for each electric appliance in advance, compares the received packet with the definition files for the each electric appliance, scores the packet, extracts a definition file with a high score, and determines electric appliance information of the extracted definition file as electric appliance information of the electric appliance. | 2013-01-10 |
20130013595 | PROVIDING CONTEXT RELEVANT SEARCH FOR A USER BASED ON LOCATION AND SOCIAL INFORMATION - A social networking system provides relevant third-party content objects to users by matching user location, interests, and other social information with the content, location, and timing associated with the content objects. Content objects are provided based on relevance scores specific to a user. Relevance scores may be calculated based on the user's previous interactions with content object notifications, or based on interests that are common between the user and his or her connections in the social network. Context search is also provided for a user, wherein a list of search of results is ranked according to the relevance score of content object associated with the search results. Notifications may also be priced and distributed to users based on their relevance. In this way, the system can provide notifications that are relevant to user's interests and current circumstances, increasing the likelihood that they will find content objects of interest. | 2013-01-10 |
20130013596 | DOCUMENT-RELATED REPRESENTATIVE INFORMATION - Some implementations include techniques and arrangements to provide document-related representative information with search results. For example, a representative query and/or representative results may be provided for one or more individual documents identified in a set of search results to supplement the search results returned in response to a received search query. The representative queries may be determined by correlating a plurality of previously submitted queries in search log data with a plurality of documents returned in response to the queries. In some implementations, click-through frequency for a particular document with respect to the plurality of queries may be taken into consideration when determining the representative queries for the particular document. In some implementations, the representative queries serve to categorize the search results based on subject matter, and a link may be provided to representative results corresponding to the representative query for accessing documents directed to similar subject matter. | 2013-01-10 |
20130013597 | Processing Repetitive Data - The present disclosure introduces a method, an apparatus, and a system of processing repetitive data. In an example embodiment, the data structure of the comparison data to be compared is processed as having a same data structure of the data in the repetition database. The repetition database is formed by an internal memory mapping after processing data in a database according to a preset data structure. The processed comparison data is compared with data in the repetition database to determine whether the comparison data is repetitive data. After it is determined that the comparison data is not repetitive data, the comparison data is written into the database. The techniques described herein improve the efficiency of the servers for eliminating repetitive data and save the server resources. | 2013-01-10 |
20130013598 | MANAGING A FLOW TABLE - A device may include a flow table to store, in flow table records, statistics associated with a number of data flows, and a flow type table to store, in flow type table records, information that indicates whether to store statistics in the flow table for each of a number of types of data flows, information that indicates a manner for sampling data units associated with the data flows, and/or information that indicates when to delete flow table records from the flow table. | 2013-01-10 |
20130013599 | Identifying a candidate part of a map to be updated - A method for identifying a candidate part of a map to be updated. The method comprises receiving position data relating to a plurality of reroute points and determining one or more clusters of reroute points based on the position data. The method further comprises determining cluster features, determining a weight for each of the clusters and generating reroute cluster position data which is transmitted in a last step of the method. By determining clusters of reroute points and corresponding weights, a candidate part of a map to be updated may be identified in an efficient way. A corresponding device and computer program product are also provided. | 2013-01-10 |
20130013600 | ATTRIBUTE CHANGE COALESCING IN ORDER TO DEAL WITH COMPONENT MOVES ON A PAGE - Embodiments of the invention provide for applying multiple attribute changes to components of a dataset. According to one embodiment, coalescing changes can comprise reading a definition of the dataset. For example, the definition can comprise an identity and a context for each of the plurality of components. A component tree can be generated representing the data set and based on the context and identity. An indication of one or more changes to the components of the data set can be received and the changes can be classified based on a type of each of the changes. For example, the type of the changes can comprise one or more of a single component change, a cross-component change, and a cross-component change the affects the identity of at least one of the components The changes can be coalesced based on the type of the changes. | 2013-01-10 |
20130013601 | SYSTEM AND METHOD FOR GROUPING OF USERS INTO OVERLAPPING CLUSTERS IN SOCIAL NETWORKS - Members of a social network user's social graph are automatically segregated into overlapping clusters according to patterns of their past communications. Each cluster within the social graph represents a group of members having a high degree of intra-cluster communication or other connection with one another. The clustering is performed according to a sorting or ranking in accordance with non-principal eigenvectors of connectivity matrices describing the intra-cluster communications/connections. The overlapping clusters exhibit maximum internal density and minimum external sparsity. | 2013-01-10 |
20130013602 | DATABASE SYSTEM - Operating a database system comprises: storing a database table comprising a plurality of rows, each row comprising a key value and one or more attributes; storing a primary index for the database table, the primary index comprising a plurality of leaf nodes, each leaf node comprising one or more key values and respective memory addresses, each memory address defining the storage location of the respective key value; creating a new leaf node comprising one or more key values and respective memory addresses; performing a memory allocation analysis based upon the lowest key value of the new leaf node to identify a non-full memory page storing a leaf node whose lowest key value is similar to the lowest key value of the new leaf node; and storing the new leaf node in the identified non-full memory page. | 2013-01-10 |
20130013603 | SEMIOTIC INDEXING OF DIGITAL RESOURCES - A method of classifying a plurality of documents. The method includes steps of providing a first set of classification terms and a second set of classification terms, the second set of classification terms being different from the first set of classification terms; generating a first frequency array of a number of occurrences of each term from the first set of classification terms in each document; generating a second frequency array of a number of occurrences of each term from the second set of classification terms in each document; generating a first similarity matrix from the first frequency array; generating a second similarity matrix from the second frequency array; determining an entrywise combination of the first similarity matrix and the second similarity matrix; and clustering the plurality of documents based on the result of the entrywise combination. | 2013-01-10 |
20130013604 | Method and System for Making Document Module - It can automatically be extracted a document module from a plurality of documents and be made a document module database. | 2013-01-10 |
20130013605 | Managing Storage of Data for Range-Based Searching - In general, a value of a numerical attribute of a record stored in a data structure is received. A numerical range is generated that includes the value of the numerical attribute. An entry is stored, in an index associated with the data structure, that specifies a location of the record within the data structure and that includes a first index key and a second index key. The first index key corresponds to a value of an attribute of the record different from the numerical attribute, and the second index key corresponds to the generated numerical range. | 2013-01-10 |
20130013606 | Managing Storage of Data for Range-Based Searching - In general, a value of a numerical attribute of a record stored in a data structure is received. A numerical range is generated that includes the value of the numerical attribute. An entry is stored, in an index associated with the data structure, that specifies a location of the record within the data structure and that includes a first index key and a second index key. The first index key corresponds to a value of an attribute of the record different from the numerical attribute, and the second index key corresponds to the generated numerical range. | 2013-01-10 |
20130013607 | SYSTEMS, METHODS, AND MEDIA FOR CORRELATING OBJECTS ACCORDING TO RELATIONSHIPS - Systems, methods, and media for correlating objects according to relationships are provided herein. According to some embodiments, methods may include the steps of for each object in a database, determining a static weight, the static weight representing a number of relational connections between each object and one or more connected entities, setting a delta weight for each object, the delta weight being equal to the static weight, determining which object in the database comprises a highest delta weight, propagating the highest delta weight of the object to each of the connected entities, adding the highest delta weight to a static weight and a delta weight for each of the connected entities, setting the delta weight for the object to zero, wherein the method terminates upon determining that a highest delta weight for at least one object is below a threshold value. | 2013-01-10 |
20130013608 | GENERATING A TAXONOMY FOR DOCUMENTS FROM TAG DATA - Tags on documents are clustered using tag weightings of the tags on the documents. Each cluster includes an identified subject. The identified subjects are compared to identify relationships between the identified subjects. A taxonomy of subjects is built using the identified relationships between the identified subjects programmatically without user intervention. | 2013-01-10 |
20130013609 | SYSTEMS AND METHODS FOR CLASSIFYING AND TRANSFERRING INFORMATION IN A STORAGE NETWORK - Systems and methods for data classification to facilitate and improve data management within an enterprise are described. The disclosed systems and methods evaluate and define data management operations based on data characteristics rather than data location, among other things. Also provided are methods for generating a data structure of metadata that describes system data and storage operations. This data structure may be consulted to determine changes in system data rather than scanning the data files themselves. | 2013-01-10 |
20130013610 | ALLOCATING AND MANAGING RANDOM IDENTIFIERS USING A SHARED INDEX SET ACROSS PRODUCTS - Provided are techniques for selecting row identifiers from an initial index structure storing rows of randomized indexes. The row identifiers are randomized. Groups are formed with the randomized row identifiers so that each group has a predetermined number of row identifiers. At least one group is selected from the groups. Indexes are retrieved from the initial index structure that correspond to the row identifiers in the selected at least one group. The retrieved indexes are encoded by adding product information to form new identifiers. | 2013-01-10 |
20130013611 | GROUPING APPARATUS, COMPUTER-READABLE RECORDING MEDIUM, AND GROUPING METHOD - A grouping apparatus ( | 2013-01-10 |
20130013612 | TECHNIQUES FOR COMPARING AND CLUSTERING DOCUMENTS - Certain example embodiments relate to techniques for analyzing documents. A plurality of documents/document portions are imported into a database, with at least some of the documents/document portions being structured and at least some being unstructured. The imported documents/document portions are organized into one or more collections. A selection of at least one of the one or more collections is made. An index of words and/or groups of words is built (and optionally refined in accordance with one or more predefined rules) based on each of the document or document portion in each selection. A document-word matrix is built (and optionally weighted using a semantic approach), with the matrix including a value indicative of a number of times each word and/or group of words in the index appears in each document/document portion. One or more clusters of documents are generated using the document-word matrix. | 2013-01-10 |
20130013613 | STRUCTURED REQUIREMENTS MANAGEMENT - A requirements management tool, where each requirement is defined by one or more design element values. Each of the design element values is a unique value and is a member of a group of design element values defined for the project. As each requirement is created, the design element values for the requirement are selected from the group of design element values, or alternatively, a new design element value may be entered by a user, and the new design element value will be added to the group of element values. Each design element value corresponds to a category that each of the requirements are broken down into. Design element values in the created requirement are compared to design element values in existing requirements, and results of this duplication check are presented to a user of the requirements management tool. | 2013-01-10 |
20130013614 | Identifying Software - Software installed on a computer network is often inconsistently, or even incorrectly, identified. The same software may be identified in different ways. A catalogue of standardised identifiers is provided. The actual identifiers of software installed on the network are accessed and they are mapped to the standardised identifiers of the catalogue. The standardised identifiers are used to manage the installed software, monitor license compliance and/or, monitor maintenance agreements amongst other uses. Data relating to the use of the software may also be obtained and associated with the identification data. The usage data together with the standardised identifiers allows managers to more reliably manage software on the network. For example un-used software may be un-installed and licenses cancelled or reallocated. | 2013-01-10 |
20130013615 | PROVIDING ANSWERS TO QUESTIONS INCLUDING ASSEMBLING ANSWERS FROM MULTIPLE DOCUMENT SEGMENTS - A method, system and computer program product for generating answers to questions. In one embodiment, the method comprises receiving an input query, identifying a plurality of candidate answers to the query; and for at least one of these candidate answers, identifying at least one proof of the answer. This proof includes a series of premises, and a multitude of documents are identified that include references to the premises. A set of these documents is selected that include references to all of the premises. This set of documents is used to generate one or more scores for the one of the candidate answers. A defined procedure is applied to the candidate answers to determine a ranking for the answers, and this includes using the one or more scores for the at least one of the candidate answers in the defined procedure to determine the ranking for this one candidate answer. | 2013-01-10 |
20130013616 | Systems and Methods for Natural Language Searching of Structured Data - The invention relates to searching structured data using natural language searches. More specifically and preferably, the invention relates to the use of an inverted file index built from generated documents to make data, typically unsearchable using a natural language search, searchable. | 2013-01-10 |
20130013617 | INDEXING TIMESTAMP WITH TIME ZONE VALUE - Techniques are described for processing a query to produce query results, the query specifying at least a first timestamp value. Embodiments receive the query for processing and access a database index containing a plurality of database keys. The database index contains one or more database index keys, each of which includes at least a timestamp value and a time zone value. Embodiments compare the first timestamp value specified in the query with a portion of one the database index keys to locate at least a portion of the query results. More specifically, the compared portion of the database index key excludes the time zone value. The located portion of the query results is then retrieved. | 2013-01-10 |
20130013618 | METHOD OF REDUCING REDUNDANCY BETWEEN TWO OR MORE DATASETS - A method for reducing redundancy between two or more datasets of potentially very large size. The method improves upon current technology by oversubscribing the data structure that represents a digest of data blocks and using positional information about matching data so that very large datasets can be analyzed and the redundancies removed by, having found a match on digest, expands the match in both directions in order to detect and eliminate large runs of data by replace duplicate runs with references to common data. The method is particularly useful for capturing the states of images of a hard disk. The method permits several files to have their redundancy removed and the files to later be reconstituted. The method is appropriate for use on a WORM device. The method can also make use of L2 cache to improve performance. | 2013-01-10 |
20130013619 | PEER-TO-PEER REDUNDANT FILE SERVER SYSTEM AND METHODS - Peer-to-peer redundant file server system and methods include clients that determine a target storage provider to contact for a particular storage transaction based on a pathname provided by the filesystem and a predetermined scheme such as a hash function applied to a portion of the pathname. Servers use the same scheme to determine where to store relevant file information so that the clients can locate the file information. The target storage provider may store the file itself and/or may store metadata that identifies one or more other storage providers where the file is stored. A file may be replicated in multiple storage providers, and the metadata may include a list of storage providers from which the clients can select (e.g., randomly) in order to access the file. | 2013-01-10 |
20130013620 | METHOD OF OPERATING A NAVIGATION SYSTEM TO PROVIDE GEOGRAPHIC LOCATION INFORMATION - A computer implemented method of operating a navigation system to provide geographic location information is provided. The method comprises receiving a query text string representing a query for a geographic location from a user and obtaining data records that represent a plurality of candidate geographic locations. The method computes a text matching score that indicates how much of the query text string matches a record text string of the candidate geographic location and applies a usage pattern weight to the text matching score to obtain an overall score value for the candidate geographic location. The candidate geographic locations are ranked based on the overall score values. | 2013-01-10 |
20130013621 | Entity Display Priority in a Distributed Geographic Information System - A system for ranking geospatial entities is described. In one embodiment, the system comprises an interface for receiving ranking data about a plurality of geospatial entities and an entity ranking module. The module uses a ranking mechanism to generate place ranks for the geospatial entities based on the ranking data. Ranked entity data generated by the entity ranking module is stored in a database. The entity ranking module may be configured to evaluate a plurality of diverse attributes to determine a total score for a geospatial entity. The entity ranking module may be configured to organize ranked entity data into placemark layers. | 2013-01-10 |
20130013622 | Media Recommendations for a Social-Software Website - Collaborative-filtering software creates a neighborhood using a map-reduce architecture by pair-wise application of a similarity measure to a sparse matrix of users and items of media designated by the users. The collaborative-filtering software then generates recommendations for a particular user by rating items of media designated by other users in the neighborhood (but not the particular user). The collaborative-filtering software rates the item of media, using a weighted vote of the users in the neighborhood. The weighted vote depends at least in part on the mean similarity of the users in the neighborhood who have designated the item of media. Then the collaborative-filtering software records the item of media as a recommendation for subsequent presentation to the other user, if the rating of the item of media is among the highest in comparison to the ratings of other items of media designated by users in the neighborhood. | 2013-01-10 |
20130013623 | SYSTEM AND METHOD FOR MANAGING INFORMATION OF BIOLOGICAL ENTITIES - A system and method for managing, tracking and recording one or more biological process inputs, outputs and their derived forms is provided. The inputs pertaining to the biological process inputs, outputs and their derived forms are received and processed. The inputs include information related to the biological processes and the biological process inputs, outputs and their derived forms. The inputs further include information related to modifications in the biological process inputs, outputs and their derived forms. The inputs also include outputs of the biological processes. The inputs are processed by modifying the received inputs into a predefined format. Thereafter, the received inputs and processed inputs are stored. The stored inputs are accessed for managing, tracking and recording the biological processes, biological process inputs, outputs and their derived forms. | 2013-01-10 |
20130013624 | Reducing Errors in Sending File Attachments - The claimed subject matter comprises a technology to scan a document for file attachments, generate alternative file names corresponding to a particular attachment, determine whether or not the particular file attachment is the latest version of a file or has a name and/or file path that could be confused with the name and/or path of another file. In the event one of the above conditions are met, the technology provides the means for a user to verify that the file attachment is the desired file and, if necessary, to select an alternative file for attachment. | 2013-01-10 |
20130013625 | ESTIMATING APPARATUS, ESTIMATING METHOD, AND PROGRAM - An estimating apparatus includes: a tag extracting unit configured to collect a blog via a network, the blog including a character string written by an individual to a web site; a provisional broadcasting station estimating unit configured to estimate a broadcasting station that broadcasts a program mentioned in the blog based on a feature word appearing in the character string of the blog; and a broadcasting station determination unit configured to refer to the blog database to count the number of the provisional broadcasting station of the program mentioned in the blog including the tag in the character string, and to determine the broadcasting station that broadcasts the program mentioned in the blog based on the counting result. | 2013-01-10 |
20130013626 | METHOD AND SYSTEM FOR GENERATING MEDIA RECOMMENDATIONS IN A DISTRIBUTED ENVIRONMENT BASED ON TAGGING PLAY HISTORY INFORMATION WITH LOCATION INFORMATION - A computer-implemented method and system are provided for generating media recommendations in a media recommendation network. Aspects of the method and system include receiving by a server a plurality of play histories of media items from a plurality of users of devices, wherein at least a portion of the media items are tagged with corresponding time and location data indicating a time and location of play; receiving by the server a media recommendation request from a requester, including receiving seed information indicating a current location of the requester; using at least one of user preferences of the requester and the seed information to identify correlated users from which to search corresponding play histories from among the plurality of play histories; comparing the seed information to the corresponding play histories and generating a list of related media items contained therein; and returning the list of related media items to the requester. | 2013-01-10 |
20130013627 | METHOD FOR MODIFYING NOTIFICATIONS IN AN ELECTRONIC DEVICE - An embodiment relates to a novel apparatus and method for changing modes of notification in an electronic device. An electronic device includes a calendar application and a variety of other applications such as the message reader application or the daily alarm application. The device is configured to use the calendar application to track whether and how the user is notified of the receipt of an electronic message. In one embodiment, the user specifically associates a profile behavior to the calendar entry when the calendar entry is first created. | 2013-01-10 |
20130013628 | LIGHTNING SEARCH BOOKMARK - Disclosed are methods and apparatus for automatically storing and generating bookmarks. In one embodiment, a search query is received. Information identifying a bookmark representing the search query is automatically stored in association with a set of bookmarks. Search results corresponding to the search query are automatically obtained and provided, where the search results identify one or more documents. When one of the documents is selected, a link to the selected one of the documents is automatically stored in association with the bookmark. | 2013-01-10 |
20130013629 | INFORMATION RETRIEVAL FROM A COLLECTION OF INFORMATION OBJECTS TAGGED WITH HIERARCHICAL KEYWORDS - As a user navigates a web site, a system can formulate or allow the user to formulate a query. The system can automatically expand the query to include additional keywords that were not present in the original query. The system can search a database using the expanded query to identify a set of information objects, each having at least one keyword that is present in the expanded query. The database may include a plurality of database tables, each describing a keyword hierarchy. A hierarchy may correspond to a subject matter category addressed by the information object. Another hierarchy may correspond to a project phase addressed by the information object. Still another hierarchy may correspond to the role or intended audience of the information object. The set of information objects thus identified can be displayed on a client computer where the user can see the results. | 2013-01-10 |
20130013630 | LIVE DASHBOARD - A computing device receives a request for data, the request including criteria for data requested to be provided to the client device. Via a service configured to retrieve the requested data, at least some of the criteria are transmitted to a staging data store that includes transactional data. Via the service, data relevant to at least some of the criteria transmitted to the staging data store is received from the staging database. The data received from the staging database is stored in a data structure included in the computing device. At least some of the data stored in the data structure is transmitted to a client device. | 2013-01-10 |
20130013631 | DENSITY BASED CLUSTERING FOR MULTIDIMENSIONAL DATA - A new density based clustering method for clustering data points in multidimensional space is described. Each point has a neighborhood consisting of all points that are within a preset cutoff radius or distance. Each point is assigned a density measure based on the number of points in its neighborhood. Any point that has a higher density than any of its neighboring points is the centre of a cluster and is assigned a unique cluster ID. Every other point follows a path through the graph of neighboring points such that density is increasing as fast as possible until a cluster center is reached. The algorithm's performance is demonstrated on a one-dimensional, two-dimensional, and 18-dimensional dataset. | 2013-01-10 |
20130013632 | Method for setting up an array of technical units - A method for setting up an array of technical units and such an array are presented. The method is used for the independent setup and operation of an array of technical units, the technical units being connected to one another via a system communication bus, a query for a system resource being transmitted from a querying unit to all other units, all other units checking whether the resource has already been assigned to this unit itself, and all querying units transmitting an appropriate response to the querying units and the system resource being assigned thereto if it is not already assigned to one of the other units. | 2013-01-10 |
20130013633 | Context-and-Version-Aware Facade for Database Queries - A method, computer program product, and system for accessing versioned data objects within a database, comprising creating a first new connection to a database stored in a memory, receiving a first query from a first client that requests access to a versioned data object stored in the database, and modifying the received first query to add contextual information configured on the first new connection, so that the modified first query is able to retrieve a first version of the versioned data object that corresponds to the contextual information. | 2013-01-10 |
20130013634 | Retrieving Conversations That Match a Search Query - A server having one or more processors and memory receives a search query from a client. The server identifies a conversation relevant to the search query, where the conversation has two or more messages sharing a common set of characteristics that meet predefined criteria and a respective conversation identifier. Identifying a conversation relevant to the search query comprises identifying a conversation that, as a whole, is relevant to the search query. The server returns to the client for display, as a search result for the search query, conversation information corresponding to the identified conversation. | 2013-01-10 |
20130013635 | LOCATION-BASED DATA SERVICE APPARATUS AND METHOD - One aspect of the invention provides a method including: receiving shape information describing a shape of a first space of interest (SOI); receiving location information describing a location of the first SOI; associating the shape information with the location information and a first unique ID to form a first SOI object; receiving second information describing at least one of a shape or a location of a second SOI; associating the second information and a second unique ID to form a second SOI object; and associating the first SOI object with the second SOI object. | 2013-01-10 |
20130013636 | METHOD AND SYSTEM FOR PROCESSING QUERIES INITIATED BY USERS OF MOBILE DEVICES - In one embodiment, a method for processing queries initiated by users of mobile devices includes receiving an incoming message containing a query initiated by a user of a mobile device, and extracting the query from the received message. The message further includes obtaining a result of the query and creating an outgoing message with the result of the query for delivery to the mobile device. | 2013-01-10 |
20130013637 | DYNAMICALLY CREATING QUERIES TO FIND RELATED RECORDS IN A DATABASE - A system that generates display objects in a graphical user interface that enable the user of an application which accesses a data repository through result sets to dynamically construct a new query to show all database records having the same contents as a specified set of fields in a currently active database record. Display objects are further generated that enable the user to specify how the contents of the selected fields are to be matched (e.g. exact matching, inclusion, etc.) and/or logical relationships between specified field contents (e.g. Boolean operators such as AND, OR, NOT, etc.). In one embodiment, once a query is defined in this way, it is stored, for example in the user's profile, so that the user can access it across uses of the application. | 2013-01-10 |
20130013638 | Intelligent Search - A method includes loading at least two databases in a server, a first database including smart tags referred to as stags and a second database including searchable content, enabling a user to generate one or more searches using the stags, each of the stags including at least one or more what components, an equal number of or a single where component, a single how component, several where components and a single how component, or several how components that are linked with another how component, and descriptive metadata and usage data, converting the stags with an interpreting engine into a search query, maintaining in a stag management engine the stag and usage data, generating data from third party databases to rank stags in a graphical user interface, and generating a list of matching results of database records and stags depending on a user selection. | 2013-01-10 |
20130013639 | PEER-TO-PEER REDUNDANT FILE SERVER SYSTEM AND METHODS - Peer-to-peer redundant file server system and methods include clients that determine a target storage provider to contact for a particular storage transaction based on a pathname provided by the filesystem and a predetermined scheme such as a hash function applied to a portion of the pathname. Servers use the same scheme to determine where to store relevant file information so that the clients can locate the file information. The target storage provider may store the file itself and /or may store metadata that identifies one or more other storage providers where the file is stored. A file may be replicated in multiple storage providers, and the metadata may include a list of storage providers from which the clients can select (e.g., randomly) in order to access the file. | 2013-01-10 |
20130013640 | MINING GENERALIZED SPATIAL ASSOCATION RULE - A system, method and computer program product for mining a rule including spatial information and non-spatial information by using a SAR (Spatial Association Rule) mining tool. The computing system is configured to construct an expanded spatial predicate transaction table for reference spatial objects and a generalized taxonomy for task-relevant spatial objects. The computing system is configured to run the SAR mining tool with the constructed expanded spatial predicate transaction and the generalized taxonomy. The computing system outputs, from the SAR mining tool, a set of generalized spatial association rules for the reference spatial objects. The generalized spatial association rule includes the spatial information and non-spatial information, associated with both the reference spatial objects and the task-relevant spatial objects. | 2013-01-10 |
20130013641 | INTELLIGENT DECISION SUPPORT FOR CONSENT MANAGEMENT - Embodiments of the invention relate to a method for intelligently providing consent to access a record in a shared pool of resources. Tools are provided to support policies to address and maintain restrictive access of a designated record, both with respect to local and non-local rules and regulations, as well as personal restrictions pertaining to personal and discretionary sharing decisions. | 2013-01-10 |
20130013642 | WEB BASED TEMPLATE REPORTING SYSTEM - A system for generating an on-line report that includes a host site connected to user terminals the Internet. The host site has a relational database for storing data and a server connected to the database and to the Internet. Users access and manipulate data, create reporting templates, and customize and run reports on the host site. The host site includes a web pages that display options for accessing the relational database to create a data framework, web pages that display options for accessing the data framework to design a reporting template; and web pages that display options for accessing the reporting template to customize and run at least one report. | 2013-01-10 |
20130013643 | SYSTEM AND METHOD OF HANDLING FILE METADATA - A network storage system comprises data storage, one or more file system APIs, and a metadata handler. The data storage can comprise file data and associated metadata. The file system APIs can be configured to read and write file data and metadata to and from the data storage. The metadata handler can have a library of functions for handling the metadata. The library can include a metadata blob creation function and a metadata blob extraction function. The metadata blob creation function cooperates with the file system APIs to read source metadata associated with specified file data and creates and populates a metadata blob from which a substantial copy of the source metadata can be generated. The metadata blob extraction function receives at least a metadata blob, extracts information from the metadata blob, and cooperates with the file system APIs to generate destination metadata, a substantial copy of the source metadata. | 2013-01-10 |
20130013644 | METHOD AND APPARATUS FOR SEEDED USER INTEREST MODELING - Methods and apparatuses are provided for user interest modeling. A method may include receiving an input from a user for specifying one or more topics from among a predetermined hierarchy of topics and subtopics. The method may additionally include retrieving one or more documents associated with the user and extracting language tokens from the documents based, at least in part, on the specified topics. Corresponding apparatuses are also provided. | 2013-01-10 |
20130013645 | SEMANTIC MATCHING - In a method, system, and computer-readable medium having instructions for semantic matching, a configuration for one or more ontologies is determined with an ontology that has one or more concepts and a representation for the one or more concepts, and the configuration has an assignment of concepts to positions and one or more relationships between concepts in accordance with the representation. The configuration is optimized in accordance with one or more constraints, and a constraint has a relationship defined in a representation for an ontology and a judgment on a similarity of a plurality of concepts from the one or more ontologies, and an estimate is calculated for a similarity between a first concept and a second concept using the configuration. | 2013-01-10 |